Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
CPM/LOB Scheduling Method for Project Deadline Constraint Satisfaction
Abstract This paper presents a methodology to improve CPM/LOB scheduling method for deadline constraint satisfaction. A complete and simple heuristic approach called “heuristic line of balance” (HLOB) is introduced for scheduling projects with serial activities. It employs four heuristic rules and their appropriate combination in addition to seeking CPM/LOB initial calculation. As an improvement to the HLOB algorithm, the “search-based heuristic line of balance” (SHLOB) algorithm is also presented, which is more efficient as projects grow in size. Finally, a complete mathematical version of the LOB model in the form of mixed integer nonlinear programming (MINLP) is applied for verification of the proposed models. Two simple case studies and a hypothetical large-scale highway project are used to test the performance of the improved models. Due to the results of this paper, HLOB and SHLOB are able to present optimum/near optimum solutions in a much more economical way that may justify their widespread use.
Graphical abstract Display Omitted
Highlights A methodology to improve integrated CPM/LOB method for deadline constraint satisfaction is presented. Heuristic rules and algorithms are suggested. It is verified by a complete mathematical-based model. Algorithms are fast, efficient and simple for use in large-scale repetitive projects.
CPM/LOB Scheduling Method for Project Deadline Constraint Satisfaction
Abstract This paper presents a methodology to improve CPM/LOB scheduling method for deadline constraint satisfaction. A complete and simple heuristic approach called “heuristic line of balance” (HLOB) is introduced for scheduling projects with serial activities. It employs four heuristic rules and their appropriate combination in addition to seeking CPM/LOB initial calculation. As an improvement to the HLOB algorithm, the “search-based heuristic line of balance” (SHLOB) algorithm is also presented, which is more efficient as projects grow in size. Finally, a complete mathematical version of the LOB model in the form of mixed integer nonlinear programming (MINLP) is applied for verification of the proposed models. Two simple case studies and a hypothetical large-scale highway project are used to test the performance of the improved models. Due to the results of this paper, HLOB and SHLOB are able to present optimum/near optimum solutions in a much more economical way that may justify their widespread use.
Graphical abstract Display Omitted
Highlights A methodology to improve integrated CPM/LOB method for deadline constraint satisfaction is presented. Heuristic rules and algorithms are suggested. It is verified by a complete mathematical-based model. Algorithms are fast, efficient and simple for use in large-scale repetitive projects.
CPM/LOB Scheduling Method for Project Deadline Constraint Satisfaction
Zolfaghar Dolabi, Hamid Reza (Autor:in) / Afshar, Abbas (Autor:in) / Abbasnia, Reza (Autor:in)
Automation in Construction ; 48 ; 107-118
06.09.2014
12 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
CPM/LOB Scheduling Method for Project Deadline Constraint Satisfaction
| British Library Online Contents | 2014
CPM/LOB Scheduling Method for Project Deadline Constraint Satisfaction
| Online Contents | 2014
Construction Scheduling Using the Constraint Satisfaction Problem Method
| Online Contents | 2013
Construction Scheduling Using the Constraint Satisfaction Problem Method
| British Library Online Contents | 2013