Next Article in Journal
Multi Similarity Metric Fusion in Graph-Based Semi-Supervised Learning
Previous Article in Journal
An Innovative Deep Learning Algorithm for Drowsiness Detection from EEG Signal
Previous Article in Special Issue
Thermal Behavior of a Building with Incorporated Phase Change Materials in the South and the North Wall
Article Menu

Export Article

Open AccessArticle
Computation 2019, 7(1), 14; https://doi.org/10.3390/computation7010014

Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints

Lublin University of Technology, Faculty of Civil Engineering and Architecture, 40 Nadbystrzycka St, 20-618 Lublin, Poland
*
Author to whom correspondence should be addressed.
Received: 29 October 2018 / Revised: 12 February 2019 / Accepted: 26 February 2019 / Published: 6 March 2019
Full-Text   |   PDF [940 KB, uploaded 6 March 2019]   |  

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). View Full-Text
Keywords: sequencing problem; scheduling; work continuity; flow shop sequencing problem; scheduling; work continuity; flow shop
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Jaśkowski, P.; Biruk, S. Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints. Computation 2019, 7, 14.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Computation EISSN 2079-3197 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top