A branch and bound method for the job-shop problem with sequence-dependent setup times |
| |
Authors: | Christian Artigues Dominique Feillet |
| |
Institution: | (1) Université de Toulouse, LAAS–CNRS, 7 Avenue du Colonel Roche, 31077 Toulouse, France;(2) LIA—Université d’Avignon, 339 Chemin Meinajariés, Agroparc, BP 1228, 84911 Avignon Cedex 9, France |
| |
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. |
| |
Keywords: | Job-shop scheduling Sequence-dependent setup times Branch and bound Constraint propagation Dynamic programming |
本文献已被 SpringerLink 等数据库收录! |
|