Viewing construction scheduling as a constraint satisfaction problem

  • Authors:
  • P. Lorterapong;T. Rattanadamrongagsorn

  • Affiliations:
  • Construction Engineering and Management Program, Department of Civil Engineering, King Mongkut's University of Technology, Thonburi, Bangkok, Thailand;Construction Engineering and Management Program, Department of Civil Engineering, King Mongkut's University of Technology, Thonburi, Bangkok, Thailand

  • Venue:
  • ICAAICSE '01 Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Construction scheduling ranks among the largest and most complex problems faced by project managers. Generating and maintaining a valid schedule in such an environment requires the full recognition for both, the existence and interactions of project entities such as activities, resources, objectives, and constraints. In real-life projects, the number of these entities are diversified and numerous. This paper addresses the construction scheduling problem from the perspective of artificial intelligence. An AI-based technique called "Constraint Satisfaction Problem (CSP)" is examined for its suitability in this domain. Principles of CSP are first presented. A step-wise procedure for scheduling and resource allocation using CSP is discussed. A numerical example is worked out to demonstrate practicality of CSP.