Abstract
This study adopts the flow shop concept used in industrial production to schedule repetitive non-linear construction projects, where specialized groups of workers execute processes in work zones (buildings) in a predefined order common to all groups. This problem is characteristic of construction projects that involve erecting multiple buildings. As the duration of the project heavily depends upon the sequence of the work zones, this study aims at providing a model and a practical approach for finding the optimal solution that assures the shortest duration of the project, allows the contractor to complete particular work zones (buildings) as soon as possible (without idle time), and conforms to a predefined sequence of work zone completion. This last constraint may arise from the client’s requirements or physical conditions of the project and has not been addressed by existing scheduling methods. Reducing the duration of the entire project brings the benefit of lower indirect costs and, if accompanied by a reduced duration of completing particular buildings (i.e., work zones), may also provide the opportunity to sell project deliverables sooner, thus improving the economic efficiency of the project. In search of optimal schedules, the authors apply the algorithms of Minimum Hamiltonian Cycle/Asymmetric Traveling Salesman Problem (ATSP).
Funder
Ministry of Science and Higher Education in Poland
Subject
Applied Mathematics,Modelling and Simulation,General Computer Science,Theoretical Computer Science
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献