A distributed shifting bottleneck heuristic for complex job shops

In this paper, we consider distributed versions of a modified shifting bottleneck heuristic for complex job shops. The considered job shop environment contains parallel batching machines, machines with sequence-dependent setup times and reentrant process flows. Semiconductor wafer fabrication facilities are typical examples for manufacturing systems with these characteristics. The used performance measure is total weighted tardiness (TWT). We suggest a two-layer hierarchical approach in order to decompose the overall scheduling problem. The upper (or top) layer works on an aggregated model. Based on appropriately aggregated routes it determines start dates and planned due dates for the jobs within each single work area, where a work area is defined as a set of parallel machine groups. The lower (or base) layer uses the start dates and planned due dates in order to apply shifting bottleneck heuristic type solution approaches for the jobs in each single work area. We conduct simulation experiments in a dynamic job shop environment in order to assess the performance of the heuristic. It turns out that the suggested approach outperforms a pure First In First Out (FIFO) dispatching scheme and provides a similar solution quality as the original modified shifting bottleneck heuristic.

[1]  Daniel E. Rivera,et al.  A model predictive control approach for real-time optimization of reentrant manufacturing lines , 2001, Comput. Ind..

[2]  Lars Mönch,et al.  Shifting-Bottleneck-Heuristik für komplexe Produktionssysteme: Softwaretechnische Realisierung und Leistungsbewertung , 2004 .

[3]  Christoph A. Schneeweiss,et al.  Distributed Decision Making , 2003 .

[4]  Reha Uzsoy,et al.  Decomposition methods for reentrant flow shops with sequence‐dependent setup times , 2000 .

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

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

[7]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[8]  Paolo Brandimarte,et al.  Conceptual modeling of an object-oriented scheduling architecture based on the shifting bottleneck procedure , 2000 .

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

[10]  Reha Uzsoy,et al.  A Computational Study of Shifting Bottleneck Procedures for Shop Scheduling Problems , 1997, J. Heuristics.

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

[12]  Michael Pinedo,et al.  A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop , 1999 .

[13]  Lars Mönch,et al.  A finite-capacity beam-search-algorithm for production scheduling in semiconductor manufacturing , 2002, Proceedings of the Winter Simulation Conference.

[14]  A.A. Rodriguez,et al.  Hierarchical modeling and control of re-entrant semiconductor manufacturing facilities , 1996, Proceedings of 35th IEEE Conference on Decision and Control.

[15]  Karl G. Kempf,et al.  A hierarchical approach to production control of reentrant semiconductor manufacturing lines , 2003, IEEE Trans. Control. Syst. Technol..

[16]  Reha Uzsoy,et al.  A REVIEW OF PRODUCTION PLANNING AND SCHEDULING MODELS IN THE SEMICONDUCTOR INDUSTRY PART I: SYSTEM CHARACTERISTICS, PERFORMANCE EVALUATION AND PRODUCTION PLANNING , 1992 .

[17]  Reha Uzsoy,et al.  Measures of subproblem criticality in decomposition algorithms for shop scheduling , 2003 .

[18]  Lars Mönch,et al.  FABMAS: An Agent-Based System for Production Control of Semiconductor Manufacturing Processes , 2003, HoloMAS.

[19]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[20]  Ari P. J. Vepsalainen.  Priority rules for job shops with weighted tardiness costs , 1987 .