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

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.

[1]  In-Chan Choi,et al.  Job shop scheduling with separable sequence-dependent setups , 1997, Ann. Oper. Res..

[2]  John W. Fowler,et al.  A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops , 2002 .

[3]  Reha Uzsoy,et al.  A shifting bottleneck algorithm for scheduling semiconductor testing operations , 1992 .

[4]  Andrea Lodi,et al.  A Hybrid Exact Algorithm for the TSPTW , 2002, INFORMS J. Comput..

[5]  P. Brucker,et al.  A branch & bound method for the general-shop problem with sequence dependent setup-times , 1996 .

[6]  Wpm Wim Nuijten,et al.  Time and resource constrained scheduling : a constraint satisfaction approach , 1994 .

[7]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[8]  Egon Balas,et al.  Job shop scheduling with setup times, deadlines and precedence constraints , 2008, J. Sched..

[9]  J. M. J. Schutten.  Practical job shop scheduling , 1998, Ann. Oper. Res..

[10]  Rainer Kolisch.  Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation , 1994 .

[11]  Wim Nuijten,et al.  Solving Scheduling Problems with Setup Times and Alternative Resources , 2000, AIPS.

[12]  Fahiem Bacchus,et al.  Proceedings of the International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002) , 2002, AAAI 2002.

[13]  Jon K. Wilbrecht,et al.  The Influence of Setup Time on Job Shop Performance , 1969 .

[14]  Roman Barták,et al.  Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times , 2002, AIPS.

[15]  Pius J. Egbelu,et al.  Scheduling in a manufacturing shop with sequence-dependent setups , 1989 .

[16]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[17]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[18]  Peter Brucker,et al.  The job-shop problem and immediate selection , 1994, Ann. Oper. Res..

[19]  Markus P. J. Fromherz,et al.  Constraint-based scheduling , 2001, Proceedings of the 2001 American Control Conference. (Cat. No.01CH37148).

[20]  James S. Noble,et al.  An approach to job shop scheduling with sequence-dependent setups , 1999 .

[21]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[22]  Pierre Lopez,et al.  Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis , 2005, Ann. Oper. Res..

[23]  Christian Artigues,et al.  A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times , 2004, CPAIOR.

[24]  Laurent Péridy.  Le problème de job-shop : arbitrages et ajustements , 1996 .

[25]  Helena Ramalhinho Dias Lourenço,et al.  Solving Two Production Scheduling Problems with Sequence-Dependent Set-Up Times , 1999 .

[26]  Reha Uzsoy,et al.  Exploiting shop floor status information to schedule complex job shops , 1994 .

[27]  David B. Shmoys,et al.  A New Approach to Computing Optimal Schedules for the Job-Shop Scheduling Problem , 1996, IPCO.

[28]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[29]  Christian Artigues,et al.  Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem , 2005, INFORMS J. Comput..

[30]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[31]  Amedeo Cesta,et al.  Iterative-Sampling Search for Job Shop Scheduling with Setup Times , 2009 .

[32]  M. A. B. Candido,et al.  A genetic algorithm based procedure for more realistic job shop scheduling problems , 1998 .

[33]  Pierre Lopez,et al.  Overview and Possible Extensions of Shaving Techniques for Job-Shop Problems ! , 2000 .

[34]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[35]  B. T. Houlden.  Operations Research/Management Science , 1962 .

[36]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[37]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[38]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Local Search , 1996, INFORMS J. Comput..

[39]  E. Balas,et al.  New classes of efficiently solvable generalized Traveling Salesman Problems , 1999, Ann. Oper. Res..

[40]  Egon Balas,et al.  Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study , 2000, INFORMS J. Comput..

[41]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[42]  J. Carlier.  The one-machine sequencing problem , 1982 .

[43]  S. C. Kim,et al.  Impact of sequence-dependent setup time on job shop scheduling performance , 1994 .

[44]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[45]  I. Choi,et al.  A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups , 2002 .