Premium
Scheduling Optimization of Linear Schedule with Constraint Programming
Author(s) -
Tang Yuanjie,
Liu Rengkui,
Wang Futian,
Sun Quanxin,
Kandil Amr A.
Publication year - 2018
Publication title -
computer‐aided civil and infrastructure engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.773
H-Index - 82
eISSN - 1467-8667
pISSN - 1093-9687
DOI - 10.1111/mice.12277
Subject(s) - computer science , mathematical optimization , scheduling (production processes) , two level scheduling , linear programming , dynamic priority scheduling , critical path method , fair share scheduling , rate monotonic scheduling , schedule , nurse scheduling problem , job shop scheduling , constraint programming , algorithm , engineering , mathematics , systems engineering , stochastic programming , operating system
Abstract In recent decades, construction project scheduling optimization has received extensive attention from the research community. However, the most commonly used scheduling approach, the critical path method, is often inapplicable to transportation‐type linear projects. Recently, the linear scheduling method (LSM) has demonstrated many advantages for such projects and has become a popular research subject. As a relatively novel scheduling method, LSM requires further improvement, as there are restrictions associated with the scheduling/optimization of linear projects. By analyzing results from previous studies, we propose a unique three‐element mode, a description method for LSM's logical relationships and constraints system. An LSM‐based scheduling optimization model based on constraint satisfaction problems and constraint programming is then proposed that could be used in classical scheduling optimization problems with flexibility, practicability, and solution superiority. The proposed model is verified using three practical transportation construction projects. Verification under six optimization scenarios demonstrates the advantages of our approach.