Article ID: | iaor2009945 |
Country: | Netherlands |
Volume: | 159 |
Issue: | 1 |
Start Page Number: | 135 |
End Page Number: | 159 |
Publication Date: | Mar 2008 |
Journal: | Annals of Operations Research |
Authors: | Artigues Christian, Feillet Dominique |
Keywords: | programming: branch and bound, programming: dynamic, programming: constraints |
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.