Effective Project Scheduling Under Workspace Congestion and Workflow Disturbance Factors

Vitaly Semenov
Anton Anichkin
Sergey Morozov
Oleg Tarlapan
Vladislav Zolotov


Effective project management implies the use of advanced planning and scheduling methods that allow to determine feasible sequences of activities and to complete a project on time and on budget. Traditional scheduling tools like fundamental Critical Path Method (CPM) and various methods for Resource Constrained Project Scheduling Problem (RCPSP) and Time Constrained Project Scheduling Problem (TCPSP) have many shortcomings for construction projects where spatial factor plays a critically important role. Previous attempts to interpret space as a specific resource were successful for particular problems of line-of-balance scheduling, space scheduling, dynamic layout planning, horizontal and vertical logic scheduling, workspace congestion mitigating, scheduling multiple projects with movable resources, spatial scheduling of repeated and grouped activities and motion planning. However, none of these methods considers the spatio-temporal requirements in a holistic framework of generic RCPSP problem and provides feasible results accounting for workspace and workflow factors. In this paper we start with the classical RCPSP statement and then present mathematically strong formalisation of the extended generalised problem, taking into account workspace congestion and workflow disturbance constraints specified in practically meaningful and computationally constructive ways. For the generalised RCPSP problem an effective scheduling method is proposed. The method tends to minimise the project makespan while satisfying timing constraints and precedence relations, not exceeding resource utilisation limits, avoiding workspace congestions and keeping workflows continuous. The method reuses so-called serial scheduling scheme and provides for additional computational routines and heuristic priority rules to generate feasible schedules satisfying all the imposed requirements. Advantages of the method and prospects for its application to industrial needs are outlined in the paper too.


Planning and scheduling, Resource-constrained project scheduling problem, Priority rules, 4D modelling, Workspace management

Full Text:



Ahuja H. N. 1976, Construction Performance Control by Networks, John Wiley & Sons, New York.

Boctor F. F. 1990, 'Some efficient multi-heuristic procedures for resource constrained project scheduling', European Journal of Operational Research, 49, 3-13.

Bowers J. A. 1995, 'Criticality in resource-constrained networks', Journal of the Operational Research Society, 46(1), 80-91.

Chavada R., Dawood N & Kassem M. 2012, 'Construction workspace management: the development and application of a novel nD planning approach and tool', Journal of Information Technology in Construction, 17, 213-36.

Choo H. J. & Tommelein I. D. 1999, Space Scheduling Using Flow Analysis, Proceedings IGLC-7, 299-312.

Chua D., Yeoh K & Song Y. 2010, 'Quantification of spatial temporal congestion in Four-dimensional computer-aided design', Journal of Construction Engineering and Management, 136 (6), 641-9.

David E. W & Patterson J. H. 1975, 'A comparison of heuristic and optimum solutions in resource-constrained project scheduling', Management Science, 21(8), 944-55.

Ellips M & Davoud S. 2007, Classic and Heuristic Approaches in Robot Motion Planning - A Chronological Review, Proceedings of world academy of science, engineering and technology 23, 101- 6.

Hegazy T. 1999, 'Optimization of resource allocation and leveling using genetic algorithms', Journal of Construction Engineering and Management, 125(3), 167-75.

Kolisch R., Sprechrr A & Drexl A. 1995, 'Characterization and generation of a general class of resource-constrained project scheduling problems', Management Science, 41(10), 1693-703.

Kolisch R. 1996a, 'Efficient priority rules for the resource-constrained project scheduling problem', Journal of Operations Management, 14, 179-92.

Kolisch R. 1996b, 'Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation', Journal of Operations Management, 90, 320-33.

Lavalle S. M. 2006, Planning algorithms. Cambridge University Press, UK.

Semenov V. A., Kazakov K. A & Zolotov V.A. 2011, Virtual Construction: 4D Planning and Validation, Proceedings of the XI International Conference on Construction Applications of Virtual Reality, 135-42.

Pai S. K., Verguese, P & Rai, S. 2013, 'Application of Line of Balance Scheduling Technique (LOBST) for a Real estate sector', International Journal of Science, Engineering and Technology Research (IJSETR), 2(1), 82-95.

Thabet W. Y. & Beliveau Y. J. 1994a, 'Modeling Work Space to Schedule Repetitive Floors in Multistory Buildings', Journal of Construction Engineering and Management, 120(1), 96-116.

Thabet W. Y & Beliveau Y. J. 1994b, 'HVLS: Horizontal and Vertical Logic Scheduling for Multistory Projects', Journal of Construction Engineering and Management, 120(4), 875-92.

Yeoh K. W & Chua D.K.H. 2012, 'Mitigating Workspace Congestion: A Genetic Algorithm Approach', EPPM 2012 Conference, 107-18.

Zouein P. P & Tommelein I. D. 1999, 'Dynamic Layout Planning Using a Hybrid Incremental Solution Method', Journal of Construction Engineering and Management, 125(6), 400-8.

DOI: http://dx.doi.org/10.5130/ajceb-cs.v2i1.3768


  • There are currently no refbacks.