TY - JOUR
T1 - Solution algorithms for synchronous flow shop problems with two dominating machines
AU - Kampmeyer, Matthias
AU - Knust, Sigrid
AU - Waldherr, Stefan
PY - 2016/10/1
Y1 - 2016/10/1
N2 - In this paper, we present solution algorithms for synchronous flow shop problems with two dominating machines. In such an environment, jobs have to be moved from one machine to the next by an unpaced synchronous transportation system, which implies that the processing is organized in synchronized cycles. This means that in each cycle the current jobs start at the same time on the corresponding machines and after processing have to wait until the last job is finished. Afterwards, all jobs are moved to the next machine simultaneously. Motivated by a practical application, we investigate the special case of two dominating machines where the processing times of all jobs on these two machines are at least as large as the processing times of all jobs on the other machines and hence always determine the cycle times. After formulating the considered problem as a special vehicle routing problem, we propose mixed integer linear programming formulations and a tabu search algorithm. Finally, we present computational results for randomly generated data and show the efficiency of the approaches.
AB - In this paper, we present solution algorithms for synchronous flow shop problems with two dominating machines. In such an environment, jobs have to be moved from one machine to the next by an unpaced synchronous transportation system, which implies that the processing is organized in synchronized cycles. This means that in each cycle the current jobs start at the same time on the corresponding machines and after processing have to wait until the last job is finished. Afterwards, all jobs are moved to the next machine simultaneously. Motivated by a practical application, we investigate the special case of two dominating machines where the processing times of all jobs on these two machines are at least as large as the processing times of all jobs on the other machines and hence always determine the cycle times. After formulating the considered problem as a special vehicle routing problem, we propose mixed integer linear programming formulations and a tabu search algorithm. Finally, we present computational results for randomly generated data and show the efficiency of the approaches.
KW - Dominating machines
KW - Flow shop
KW - Synchronous movement
KW - Vehicle routing
UR - http://www.scopus.com/inward/record.url?scp=84969780538&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84969780538&partnerID=8YFLogxK
U2 - 10.1016/j.cor.2016.04.010
DO - 10.1016/j.cor.2016.04.010
M3 - Article
AN - SCOPUS:84969780538
SN - 0305-0548
VL - 74
SP - 42
EP - 52
JO - Computers and Operations Research
JF - Computers and Operations Research
ER -