A batch-oblivious approach for Complex Job-Shop scheduling problems

We consider a Flexible Job-Shop scheduling problem with batching machines, reentrant flows, sequence dependent setup times and release dates while considering different regular objective functions. Semiconductor manufacturing is probably one of the most prominent practical applications of such a problem. Existing disjunctive graph approaches for this combined problem rely on dedicated nodes to explicitly represent batches. To facilitate modifications of the graph, our new modeling reduces this complexity by encoding batching decisions into edge weights. An important contribution is an original algorithm that takes batching decisions “on the fly” during graph traversals. This algorithm is complemented by an integrated move to resequence and reassign operations. This combination yields a rich neighborhood that we apply within a local search and a Simulated Annealing (SA) metaheuristic. The latter is embedded in a Greedy Randomized Adaptive Search Procedure (GRASP) which is the most efficient approach. Numerical results for benchmark instances of different problem types show the generality and applicability of our approach. The conciseness of our idea facilitates extensions towards further complex constraints needed in real-world applications.

[1]  A. B. Kahn,et al.  Topological sorting of large networks , 1962, CACM.

[2]  Andreas Klemmt,et al.  Scheduling jobs with time constraints between consecutive process steps in semiconductor manufacturing , 2012, Proceedings Title: Proceedings of the 2012 Winter Simulation Conference (WSC).

[3]  Lars Mönch,et al.  Scheduling jobs with ready times and precedence constraints on parallel batch machines using metaheuristics , 2014, Comput. Ind. Eng..

[4]  Claude Yugma,et al.  Production control in semiconductor manufacturing with time constraints , 2015, 2015 26th Annual SEMI Advanced Semiconductor Manufacturing Conference (ASMC).

[5]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

[6]  Martin Josef Geiger,et al.  Test Instances for the Flexible Job Shop Scheduling Problem with Work Centers , 2012 .

[7]  森戸 晋,et al.  Tabu Search による Job Shop Scheduling 問題の解法(スケジューリング) , 1993 .

[8]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

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

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

[11]  Marcel Stehli,et al.  An Effective Problem Decomposition Method for Scheduling of Diffusion Processes Based on Mixed Integer Linear Programming , 2014, IEEE Transactions on Semiconductor Manufacturing.

[12]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures: Advances, Hybridizations, and Applications , 2010 .

[13]  Bernd Jurisch,et al.  Scheduling jobs in shops with multi-purpose machines , 1992 .

[14]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[15]  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..

[16]  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.

[17]  John W. Fowler,et al.  Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times , 2005, Comput. Oper. Res..

[18]  R. Uzsoy,et al.  A problem reduction approach for scheduling semiconductor wafer fabrication facilities , 2006, IEEE Transactions on Semiconductor Manufacturing.

[19]  Pascal Van Hentenryck,et al.  Maintaining Longest Paths Incrementally , 2003, Constraints.

[20]  Paul H. J. Kelly,et al.  A dynamic topological sort algorithm for directed acyclic graphs , 2007, ACM J. Exp. Algorithmics.

[21]  Yeong-Dae Kim,et al.  Scheduling Wafer Lots on Diffusion Machines in a Semiconductor Wafer Fabrication Facility , 2010, IEEE Transactions on Semiconductor Manufacturing.

[22]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[23]  M. Mathirajan,et al.  A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor , 2006 .

[24]  B. Roy,et al.  Les Problemes d'Ordonnancement , 1967 .

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

[26]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[28]  Camino R. Vela,et al.  Lateness minimization with Tabu search for job shop scheduling problem with sequence dependent setup times , 2012, Journal of Intelligent Manufacturing.

[29]  Lars Mönch,et al.  Heuristic approaches for scheduling jobs in large-scale flexible job shops , 2016, Comput. Oper. Res..

[30]  Ronny S. Hansmann,et al.  Flexible job shop scheduling with blockages , 2014, Math. Methods Oper. Res..

[31]  Vinícius Amaral Armentano,et al.  Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach , 2007, Eur. J. Oper. Res..

[32]  Pascal Van Hentenryck,et al.  Large Neighborhood Search and Adaptive Randomized Decompositions for Flexible Jobshop Scheduling , 2011, IJCAI.

[33]  Li-Chen Fu,et al.  A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival , 2010, Comput. Oper. Res..

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

[35]  Erhan Kutanoglu,et al.  Heuristic based scheduling system for diffusion in semiconductor manufacturing , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[36]  Stéphane Dauzère-Pérès,et al.  Flexibility measures for qualification management in wafer fabs , 2011 .

[37]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[38]  Zhibin Jiang,et al.  Decomposition-based classified ant colony optimization algorithm for scheduling semiconductor wafer fabrication system , 2012, Comput. Ind. Eng..

[39]  Francis W. Hallahan,et al.  Shop Floor Control Systems , 1991 .

[40]  Stéphane Dauzère-Pérès,et al.  Flexible job-shop scheduling with extended route flexibility for semiconductor manufacturing , 2014, Proceedings of the Winter Simulation Conference 2014.

[41]  John W. Fowler,et al.  A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations , 2011, J. Sched..

[42]  Stéphane Dauzère-Pérès,et al.  A batching and scheduling algorithm for the diffusion area in semiconductor manufacturing , 2012 .

[43]  J.W. Fowler,et al.  Heuristics for minimizing total weighted tardiness in complex job shops , 2005 .

[44]  Peter J. Stuckey,et al.  Scheduling Optional Tasks with Explanation , 2013, CP.

[45]  Yazid Mati,et al.  A general approach for optimizing regular criteria in the job-shop scheduling problem , 2011, Eur. J. Oper. Res..