A branch and bound method for the job-shop problem with sequence-dependent setup times

Christian Artigues 1 Dominique Feillet 2
1 LAAS-MOGISA
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
Abstract : This paper deals with the job-shop scheduling problem with sequence-dependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The method is based on iterative solving via branch and bound decisional versions of the problem. At each node of the branch and bound tree, constraint propagation algorithms adapted to setup times are performed for domain filtering and feasibility check. Relaxations based on the traveling salesman problem with time windows are also solved to perform additional pruning. The traveling salesman problem is formulated as an elementary shortest path problem with resource constraints and solved through dynamic programming. This method allows to close previously unsolved benchmark instances of the literature and also provides new lower and upper bounds.
Type de document :
Article dans une revue
Annals of Operations Research, Springer Verlag, 2007, 25 p. 〈10.1007/s10479-007-0283-0〉
Liste complète des métadonnées

Littérature citée [46 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-00103387
Contributeur : Christian Artigues <>
Soumis le : mercredi 4 octobre 2006 - 11:53:52
Dernière modification le : mardi 10 octobre 2017 - 09:52:03
Document(s) archivé(s) le : mardi 6 avril 2010 - 18:00:56

Identifiants

Citation

Christian Artigues, Dominique Feillet. A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, Springer Verlag, 2007, 25 p. 〈10.1007/s10479-007-0283-0〉. 〈hal-00103387〉

Partager

Métriques

Consultations de la notice

206

Téléchargements de fichiers

1318