Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints
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 pr...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2019-03-01
|
| Series: | Computation |
| Subjects: | |
| Online Access: | http://www.mdpi.com/2079-3197/7/1/14 |
| _version_ | 1818037158432210944 |
|---|---|
| author | Piotr Jaśkowski Sławomir Biruk |
| author_facet | Piotr Jaśkowski Sławomir Biruk |
| author_sort | Piotr Jaśkowski |
| collection | DOAJ |
| description | 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). |
| first_indexed | 2024-12-10T07:22:24Z |
| format | Article |
| id | doaj.art-21ebb58de4bd4b47807a0aeb78bab9fe |
| institution | Directory Open Access Journal |
| issn | 2079-3197 |
| language | English |
| last_indexed | 2024-12-10T07:22:24Z |
| publishDate | 2019-03-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Computation |
| spelling | doaj.art-21ebb58de4bd4b47807a0aeb78bab9fe2022-12-22T01:57:47ZengMDPI AGComputation2079-31972019-03-01711410.3390/computation7010014computation7010014Minimizing the Duration of Repetitive Construction Processes with Work Continuity ConstraintsPiotr Jaśkowski0Sławomir Biruk1Lublin University of Technology, Faculty of Civil Engineering and Architecture, 40 Nadbystrzycka St, 20-618 Lublin, PolandLublin University of Technology, Faculty of Civil Engineering and Architecture, 40 Nadbystrzycka St, 20-618 Lublin, PolandThis 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).http://www.mdpi.com/2079-3197/7/1/14sequencing problemschedulingwork continuityflow shop |
| spellingShingle | Piotr Jaśkowski Sławomir Biruk Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints Computation sequencing problem scheduling work continuity flow shop |
| title | Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints |
| title_full | Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints |
| title_fullStr | Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints |
| title_full_unstemmed | Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints |
| title_short | Minimizing the Duration of Repetitive Construction Processes with Work Continuity Constraints |
| title_sort | minimizing the duration of repetitive construction processes with work continuity constraints |
| topic | sequencing problem scheduling work continuity flow shop |
| url | http://www.mdpi.com/2079-3197/7/1/14 |
| work_keys_str_mv | AT piotrjaskowski minimizingthedurationofrepetitiveconstructionprocesseswithworkcontinuityconstraints AT sławomirbiruk minimizingthedurationofrepetitiveconstructionprocesseswithworkcontinuityconstraints |