Iterative-Sampling Search for Job Shop Scheduling with Setup Times

This paper presents a heuristic algorithm for solving the job-shop scheduling problem with sequence dependent setup times (SDST-JSSP). The algorithm relies on a core constraint-based search procedure, which generates consistent ordering of activities requiring the same resource by incrementally imposing precedence constraints on a temporal feasible solution. Key to the effectiveness of the search procedure is a conflict sampling method biased toward selection of most critical conflict and coupled with a non-deterministic choice heuristic to guide the base conflict resolution process. This constraint-based search is then embedded within a larger iterative-sampling search framework to broaden search space coverage and promote solution optimization. The efficacy of the overall heuristic algorithm is demonstrated empirically on a set of previously studied job-shop scheduling benchmark problems with sequence dependent setup times.

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

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

[3]  Ugo Montanari,et al.  Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..

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

[5]  Stephen F. Smith,et al.  A Constraint-Based Method for Project Scheduling with Time Windows , 2002, J. Heuristics.

[6]  Stephen F. Smith,et al.  From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling , 2007, AI Commun..

[7]  Stephen F. Smith,et al.  Generating Feasible Schedules under Complex Metric Constraints , 1994, AAAI.

[8]  Reha Uzsoy,et al.  Decomposition Methods for Complex Factory Scheduling Problems , 1996 .

[9]  Eugeniusz Nowicki,et al.  An Advanced Tabu Search Algorithm for the Job Shop Problem , 2005, J. Sched..

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

[11]  Camino R. Vela,et al.  Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times , 2010, J. Heuristics.

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

[13]  Stephen F. Smith,et al.  Stochastic Procedures for Generating Feasible Schedules , 1997, AAAI/IAAI.

[14]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

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

[16]  Christian Artigues,et al.  A branch and bound method for the job-shop problem with sequence-dependent setup times , 2008, Ann. Oper. Res..

[17]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..