Abstract

Repetitive scheduling methods are more effective than traditional critical path methods in the planning and scheduling of repetitive construction projects. Nevertheless, almost all the repetitive scheduling methods developed so far have been based on the premise that a repetitive project is comprised of many identical production units. In this research a non-unit-based algorithm for the planning and scheduling of repetitive projects is developed. Instead of repetitive production units, repetitive or similar activity groups are identified and employed for scheduling. The algorithm takes into consideration: (1) the logical relationship of activity groups in a repetitive project; (2) the usage of various resource crews in an activity group; (3) the maintaining of resource continuity; and (4) the time and cost for the routing of resource crews. A sample case study and a case study of a sewer system project are conducted to validate the algorithm, as well as to demonstrate its application. Results and findings are reported.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call