A parallel shifting bottleneck heuristic for scheduling complex job shops: Architecture and performance assessment

The shifting bottleneck heuristic (SBH) for complex job shops decomposes the overall scheduling problem into a series of scheduling problems related to machine groups. These smaller, more tractable, scheduling problems are called subproblems. The heuristic is based on a disjunctive graph that is used to model the relationship between the subproblems. In this paper, we introduce a parallel implementation of the SBH that is based on the idea that these subproblems are rather independent from each other. We show that the parallel implementation is much faster than the sequential version of the SBH. Hence, more computationally costly subproblem solution procedures (SSP's) can be applied within the parallel shifting bottleneck heuristic.

[1]  Rui Zhang,et al.  A hybrid approach to large-scale job shop scheduling , 2008, Applied Intelligence.

[2]  K. Kempf,et al.  Simulation of emergent behavior in manufacturing systems , 1995, Proceedings of SEMI Advanced Semiconductor Manufacturing Conference and Workshop.

[3]  Lars Mönch,et al.  A distributed shifting bottleneck heuristic for complex job shops , 2005, Comput. Ind. Eng..

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

[5]  Reha Uzsoy,et al.  Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication , 2007, J. Sched..

[6]  Mehmet Emin Aydin,et al.  Parallel variable neighbourhood search algorithms for job shop scheduling problems , 2007 .

[7]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

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

[9]  Pascal Van Hentenryck,et al.  Transparent Parallelization of Constraint Programming , 2009, INFORMS J. Comput..

[10]  John W. Fowler,et al.  Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops , 2007, Eur. J. Oper. Res..

[11]  Christos T. Maravelias,et al.  Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid , 2009, INFORMS J. Comput..

[12]  Lars Mönch,et al.  A Simulation Framework for the Performance Assessment of Shop-Floor Control Systems , 2003, Simul..

[13]  Christian Mazza.  Parallel Simulated Annealing , 1992, Random Struct. Algorithms.

[14]  Jens Clausen,et al.  Parallel branch-and-bound methods for thejob-shop scheduling problem , 1998, Ann. Oper. Res..