Construction Scheduling Using the Constraint Satisfaction Problem Method

AbstractConstruction projects are subject to numerous constraints of various types, including contractual due dates, resource limitations, and safety, financial, and managerial constraints. Most scheduling methods based on the critical path method (CPM) require that all project constraints be comprehensively defined and arranged into a single logical network for developing a project schedule. In real-life situations, however, there could be more than one option of execution, conditions, and/or precautions that may influence the logic of the project network and its outputs. CPM-based methods have been proven inadequate for scheduling in this kind of situation. This paper views construction scheduling as a constraint satisfaction problem (CSP), which is defined by a set of scheduling variables and a set of constraints. A CSP-based scheduling method has been developed to provide a framework for systematic constraint modeling and effective schedule generation. An illustrative real-life case example is present...

[1]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[2]  Sameh M. El-Sayegh,et al.  Float Consumption Impact on Cost and Schedule in the Construction Industry , 2007 .

[3]  Glenn Ballard,et al.  The Combination of Last Planner System and Location-Based Management System , 2010 .

[4]  Koshy Varghese,et al.  Application of Dependency Structure Matrix for Activity Sequencing in Concurrent Engineering Projects , 2006 .

[5]  David K. H. Chua,et al.  PDM++: Planning Framework from a Construction Requirements Perspective , 2011 .

[6]  Jian Zuo,et al.  Prediction System for Change Management in Construction Project , 2010 .

[7]  Rafael Sacks,et al.  Empire State Building Project: Archetype of “Mass Construction” , 2010 .

[8]  Iris D. Tommelein,et al.  WORKPLAN: CONSTRAINT-BASED DATABASE FOR WORK PACKAGE SCHEDULING , 1999 .

[9]  Hossam El-Bibany,et al.  PARAMETRIC CONSTRAINT MANAGEMENT IN PLANNING AND SCHEDULING: COMPUTATIONAL BASIS , 1997 .

[10]  P. Lorterapong,et al.  Viewing construction scheduling as a constraint satisfaction problem , 2001 .

[11]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[12]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[13]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[14]  Nashwan Dawood,et al.  Requirements identification for 4D constraintbased construction planning and control system , 2002 .

[15]  Roman Barták.  CONSTRAINT-BASED SCHEDULING: AN INTRODUCTION FOR NEWCOMERS , 2003 .

[16]  Ali Jaafari.  Criticism of CPM for Project Planning Analysis , 1984 .

[17]  Tarek Hegazy,et al.  Optimization of Resource Allocation and Leveling Using Genetic Algorithms , 1999 .

[18]  Jin-Lee KimJ. Kim.  Improved genetic algorithm for resource-constrained scheduling of large projects , 2009 .

[19]  Weng Tat Chan,et al.  Constraint Programming Approach to Precast Production Scheduling , 2002 .

[20]  Po-Han Chen,et al.  Smart GA-Based Cost-Scheduling Model for Resource-Constrained Projects , 2005 .

[21]  Bilal Benmessahel,et al.  An improved Combinatorial Particle Swarm Optimization Algorithm to Database Vertical Partition , 2010 .

[22]  Mustafa Pultar.  Progress-based construction scheduling , 1990 .

[23]  Mark D. Johnston,et al.  Spike: AI scheduling for NASA's Hubble Space Telescope , 1990, Sixth Conference on Artificial Intelligence for Applications.

[24]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.