Scheduling Optimization of Linear Schedule with Constraint Programming

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 m...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computer-aided civil and infrastructure engineering Ročník 33; číslo 2; s. 124 - 151
Hlavní autori: Tang, Yuanjie, Liu, Rengkui, Wang, Futian, Sun, Quanxin, Kandil, Amr A.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Hoboken Wiley Subscription Services, Inc 01.02.2018
Predmet:
Constraint modelling
Critical path
Critical path method
Optimization
Scheduling
Transportation
ISSN:1093-9687, 1467-8667
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1093-9687
1467-8667
DOI:10.1111/mice.12277