Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing

In this paper, a new combined scheduling algorithm is proposed to address the problem of minimising total weighted tardiness on re-entrant batch-processing machines (RBPMs) with incompatible job families in the semiconductor wafer fabrication system (SWFS). The general combined scheduling algorithm forms batches according to parameters from the real-time scheduling simulation platform (ReS2), and then sequences batches through slack-based mixed integer linear programming model (S-MILP), which is defined as batch-oriented combined scheduling algorithm. The new combined scheduling algorithm obtains families’ parameters from ReS2 and then sequences these families through modified S-MILP, which is defined as family-oriented combined scheduling algorithm. With rolling horizon control strategy, two combined scheduling algorithms can update RBPMs scheduling continually. The experiments are implemented on ReS2 of SWFS and ILOG CPLEX, respectively. The results demonstrate the effectiveness of our proposed methods.

[1]  Huiran Liu,et al.  Modelling of semiconductor wafer fabrication systems by extended object-oriented Petri nets , 2005 .

[2]  R. Bixby,et al.  Short-Interval Detailed Production Scheduling in 300mm Semiconductor Manufacturing using Mixed Integer and Constraint Programming , 2006, The 17th Annual SEMI/IEEE ASMC 2006 Conference.

[3]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

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

[5]  Zheng Li,et al.  A MILP-based batch scheduling for two-stage hybrid flowshop with sequence-dependent setups in semiconductor assembly and test manufacturing , 2010, 2010 IEEE International Conference on Automation Science and Engineering.

[6]  Lars MönchChristian Almeder,et al.  Ant Colony Optimization Approaches for Scheduling Jobs with Incompatible Families on Parallel Batch Machines , 2009 .

[7]  Zhibin Jiang,et al.  Closed loop control-based real-time dispatching heuristic on parallel batch machines with incompatible job families and dynamic arrivals , 2013 .

[8]  Lars Mönch,et al.  Ant Colony Optimization for Scheduling Jobs with Incompatible Families on Parallel Batch Machines , 2009 .

[9]  Ching-Jong Liao,et al.  Improved MILP models for two-machine flowshop with batch processing machines , 2008, Math. Comput. Model..

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

[11]  Andreas Klemmt,et al.  A comparison of MIP-based decomposition techniques and VNS approaches for batch scheduling problems , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

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

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

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

[15]  John W. Fowler,et al.  Minimizing total weighted tardiness on a single batch process machine with incompatible job families , 2005, Comput. Oper. Res..

[16]  N. R. Srinivasa Raghavan,et al.  Scheduling Parallel Batch Processors with Incompatible Job Families Using Ant Colony Optimization , 2006, 2006 IEEE International Conference on Automation Science and Engineering.

[17]  Purushothaman Damodaran,et al.  Mixed integer formulation to minimize makespan in a flow shop with batch processing machines , 2004, Math. Comput. Model..

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

[19]  Andreas Klemmt,et al.  Optimisation approaches for batch scheduling in semiconductor manufacturing , 2011 .

[20]  Yuehwern Yih,et al.  Development of a real-time multi-objective scheduler for a semiconductor fabrication system , 2003 .

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

[22]  Reha Uzsoy,et al.  Minimizing total tardiness on a batch processing machine with incompatible job families , 1998 .

[23]  Lars Mönch,et al.  Metaheuristics for scheduling jobs with incompatible families on parallel batching machines , 2011, J. Oper. Res. Soc..

[24]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[25]  John W. Fowler,et al.  Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness , 2004 .

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

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

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