Linear versus Network Scheduling: A Critical Path Comparison

Abstract

Linear scheduling methods provide an alternative way of scheduling repetitive projects, to the commonly used network methods. Critical path identification is a major attribute for both methods; therefore, it is very important for practitioners to understand the function of the two methods in this area. The present paper compares the critical path of the recently developed Kallantzis-Lambropoulos repetitive project model against the network scheduling critical path method (CPM), aiming at delving into and pointing out the differences and similarities between them. Initially, the rules for transforming the linear project into an equivalent CPM network are proposed. Then, the rules are applied on a sample linear project. Due to the additional constraint for maintaining resource continuity that the linear method takes into account, the critical paths vary. The constraint is subsequently removed from selected activities and comparison is repeated; the critical paths then coincide. In order to validate the findings and ensure impartiality of results, a random linear project generator is developed. A group of twenty-five random linear projects and their equivalent networks is produced. Their critical paths are analyzed, compared and classified. Conclusions support that the proposed comparison could be beneficial to users of linear scheduling methods, while the random project generator can serve other related research.