No-wait scheduling of a two-machine flow-shop to minimize the makespan under non-availability constraints and different release dates

Abstract : 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 minimises 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.
Type de document :
Article dans une revue
International Journal of Production Research, Taylor & Francis, 2011, 〈10.1080/00207543.2010.531775〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00601430
Contributeur : Ist Inria Nancy Grand Est <>
Soumis le : vendredi 17 juin 2011 - 16:35:33
Dernière modification le : mardi 27 février 2018 - 15:44:03

Identifiants

Collections

Citation

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, Taylor & Francis, 2011, 〈10.1080/00207543.2010.531775〉. 〈inria-00601430〉

Partager

Métriques

Consultations de la notice

422