Correspondence of activity relationships and critical path between time-location diagrams and critical path method

Various methods for identifying the critical path in linear schedules have been proposed over the last years. Work done in comparing these methods has shown that in many activity configurations, their results do not coincide. This paper attempts a critical path comparison between the linear scheduling method KLRPM, developed by the authors, and the network scheduling method CPM. In order to achieve this comparison, a correspondence between activity relationships of the CPM and the KLRPM is established first. The results of the two methods are then tested for some simple activity configurations and applied on an illustrative example taken from the literature. The results are commented and recommendations for further research are proposed.