Abstract
A flow-shop construction scheduling – especially for a higher number of tasks projected – requires the use of metaheuristic algorithms to find the optimal schedule. The criteria of optimality may vary as well as constraints assumed for the schedule. The paper presents base rules of the flow-shop scheduling as well as the methods of making the work of engaged brigades continuous. When the cost of work execution is analyzed, it can occur that the optimal schedule understood as providing the shortest total time of project execution or the shortest total slack times of working brigades is not the cheapest solution. The following cost generators are taken into account: a daily cost of each brigade (working or waiting for the work), the technology applied to work execution, penalties for not keeping the milestones. The model of a time-cost evaluation of the flow-shop time schedule is formulated, analyzed and discussed. For the illustration of the presented model, the exemplary flow-shop time schedule with some constraints assumed is analyzed with and without the lowest cost as a criterion of optimality.
Highlights
The flow-shop scheduling was adopted from production programming to the construction industry
There are three more assumptions: - every type of work is executed by a specialized brigade, - each brigade consists of a constant number of workers and machines, - each brigade after the start of work stays on the building site up to completing their works on the last section
It summarizes the total cost of each variant, total execution time and number of slack time days
Summary
The flow-shop scheduling was adopted from production programming to the construction industry. It is suitable for modelling, when the set of works executed in the same sequence is to be executed on more than one section. The classical problem of a flow-shop scheduling is to make a decision about the sequence of sections where the set of works should be executed in order to minimize the time when brigades wait for their work on consecutive section (to minimize so called slack-time). The specific sequence of work can be found that minimizes the total time of works execution for all section [15].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
