A branch and bound method for the job-shop problem with sequence-dependent setup times - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Operations Research Année : 2007

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

Christian Artigues

Résumé

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.
Fichier principal
Vignette du fichier
ArtiguesFeillet2006.pdf (215.6 Ko) Télécharger le fichier
Loading...

Dates et versions

hal-00103387 , version 1 (04-10-2006)

Identifiants

Citer

Christian Artigues, Dominique Feillet. A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 2007, 25 p. ⟨10.1007/s10479-007-0283-0⟩. ⟨hal-00103387⟩
203 Consultations
2563 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More