Minimizing repetitive construction project duration with work continuity constraints
Fragment książki (Rozdział monografii pokonferencyjnej)
MNiSW
5
spoza wykazu
| Status: | |
| Autorzy: | Biruk Sławomir, Jaśkowski Piotr |
| Dyscypliny: | |
| Aby zobaczyć szczegóły należy się zalogować. | |
| Wersja dokumentu: | Drukowana |
| Arkusze wydawnicze: | 0,5 |
| Język: | angielski |
| Strony: | 254 - 261 |
| Efekt badań statutowych | TAK |
| Materiał konferencyjny: | TAK |
| Nazwa konferencji: | 8th International Conference from Scientific Computing to Computational Engineering |
| Skrócona nazwa konferencji: | IC-SCCE 2018 |
| URL serii konferencji: | LINK |
| Termin konferencji: | 4 lipca 2018 do 7 lipca 2018 |
| Miasto konferencji: | Ateny |
| Państwo konferencji: | GRECJA |
| Publikacja OA: | NIE |
| Abstrakty: | angielski |
| Ability to assure continuity of works helps in reducing the duration of projects. As construction clients typically insist on shortening the construction stage anticipating benefits of the operation phase, this offers the contractor a competitive advantage. The sooner the project is commissioned, the sooner the contractor is paid, which reduces the contractor's financial cost. The authors analyze the scheduling problem with continuity of works in non-repetitive units meant for construction projects that consist in erection of multiple buildings. The aim is to speed up the works on particular buildings and, at the same time, assure entire project duration minimization. This is achieved by adapting the flow shop concept used in scheduling industrial production processes. The specialized groups of workers execute processes in locations (units, buildings) in a sequence common to all groups. Selection of this sequence profoundly affects the project completion time. The authors put forward a model for minimizing total duration of a project under constraints of fixed sequence of completing particular buildings in a project of multiple buildings and continuity of works in consecutive units. Permutation-based process sequencing was brought to the search for the Minimum Hamiltonian Cycle (well described in operations research literature). To calculate the solution of the problem, the user may rely on the existing and accessible software for Asymmetric Traveling Salesman Problem with and without Time Windows. |
