Linear versus network scheduling: A critical path comparison

Kallantzis, A; Soldatos, J; Lambropoulos, S

dc.contributor.author	Kallantzis, A	en
dc.contributor.author	Soldatos, J	en
dc.contributor.author	Lambropoulos, S	en
dc.date.accessioned	2014-03-01T01:26:33Z
dc.date.available	2014-03-01T01:26:33Z
dc.date.issued	2007	en
dc.identifier.issn	07339364	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/18128
dc.subject	Construction management	en
dc.subject	Critical path method project management	en
dc.subject	Scheduling	en
dc.subject.other	Mathematical models	en
dc.subject.other	Optimization	en
dc.subject.other	Resource allocation	en
dc.subject.other	Scheduling algorithms	en
dc.subject.other	Construction management	en
dc.subject.other	Critical path method	en
dc.subject.other	Critical paths	en
dc.subject.other	Linear projects	en
dc.subject.other	Project management	en
dc.title	Linear versus network scheduling: A critical path comparison	en
heal.type	journalArticle	en
heal.identifier.primary	10.1061/(ASCE)0733-9364(2007)133:7(483)	en
heal.identifier.secondary	http://dx.doi.org/10.1061/(ASCE)0733-9364(2007)133:7(483)	en
heal.publicationDate	2007	en
heal.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. © 2007 ASCE.	en
heal.journalName	Journal of Construction Engineering and Management	en
dc.identifier.doi	10.1061/(ASCE)0733-9364(2007)133:7(483)	en
dc.identifier.volume	133	en
dc.identifier.issue	7	en
dc.identifier.spage	483	en
dc.identifier.epage	491	en