No-wait Scheduling of a Two-machine Flow-shop to Minimize the Makespan under Non-Availability Constraints and Different Release Dates

Faten Ben Chihaoui (1) , Imed Kacem (2) , Atidel B. Hadj-Alouane (1) , Najoua Dridi (1) , Nidhal Rezg (3)

1 ENIT - Ecole Nationale d'Ingénieurs de Tunis
2 LCOMS - Laboratoire de Conception, Optimisation et Modélisation des Systèmes
3 LGIPM - Laboratoire de Génie Industriel, de Production et de Maintenance

In this paper, we consider the two-machine no-wait flow-shop scheduling problem, when every machine is subject to one non-availability constraint and jobs have different release dates. The non-availability intervals of the machines overlap and they are known in advance. We aim to find a non-resumable schedule that minimizes the makespan. We propose several lower bounds and upper bounds. These bounding procedures are used in a branch-and-bound algorithm. Computational experiments are carried out on a large set of instances and the obtained results show the effectiveness of our method.

Mots clés: Physical Sciences

Faten Ben Chihaoui, Imed Kacem, Atidel B. Hadj-Alouane, Najoua Dridi, Nidhal Rezg. No-wait Scheduling of a Two-machine Flow-shop to Minimize the Makespan under Non-Availability Constraints and Different Release Dates. International Journal of Production Research, 2011, pp.1. ⟨10.1080/00207543.2010.531775⟩. ⟨hal-00662385⟩