Two-machine no-wait flowshop scheduling with availability constraints and release dates

摘要

The two-machine no-wait flowshop problem with availability constraints and release dates is studied in this paper. We work under the assumption that each machine is unavailable during a time interval. The intervals overlap and are known in advance. Two heuristics based on Gilmore-Gomory and Cheng and Liu algorithms are proposed for this problem. An experimental study is conducted to evaluate the performance of the proposed heuristics.