Critical path analysis on a project network having non-finish-to-start FS logical relationships with lags is generally referred
to as precedence diagram method PDM. A PDM-based scheduling analysis is facilitated by mainstream project scheduling software
such as P3. However, PDM compounds total float determination and interpretation, potentially causing anomalous effects on critical
path identification. In the present research, we generalize those particular circumstances that entail applying non-FS logical relationships
on construction projects. We then propose generic transform schemes such that non-FS relationships in a PDM network can be detected
and transformed—automatically—into equivalent FS. Moreover, we provide analytical proofs for the transform schemes being proposed
to justify the logical equivalency between the original PDM network and the transformed activity-on-node AON network only having
FS logical relationships. A PDM network example demonstrates that confusions would arise in interpreting P3’s critical path analysis
results, but not in the case of the transformed AON counterpart. In conclusion, the transform schemes being proposed lead to better
understanding of the scheduling results when critical path analysis is performed on a PDM network. This also paves the way for
conducting further sophisticated scheduling analysis such as resource loading or Monte Carlo simulation on a PDM network.