Heuristic simulated annealing approach for diffusion scheduling in a semiconductor Fab

This paper presents an efficient algorithm for diffusion scheduling in a semiconductor fab. The diffusion area commonly creates long queue time in the entire process flow. Due to the complex constraints, such as parallel batching and time windows, and large solution space, it is difficult to find a feasible schedule in a timely manner. A greedy randomized procedure forms the batches. A heuristic method is introduced to handle the time window constraints. Two important properties of the problem are identified and applied to improve the quality of the solution. Simulated annealing is used as a local search procedure. Compared with the real schedule in the fab, the proposed algorithm can increase the effective moves significantly without violating queue time constraints.

[1]  Mary E. Kurz,et al.  A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families , 2006 .

[2]  Philippe Lacomme,et al.  A memetic algorithm for the job-shop with time-lags , 2008, Comput. Oper. Res..

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

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

[5]  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).

[6]  Cheng-Hung Wu,et al.  Dynamic production control in parallel processing systems under process queue time constraints , 2012, Comput. Ind. Eng..

[7]  Han-Pang Huang,et al.  Modeling and emulation of a furnace in IC fab based on colored-timed Petri net , 1998 .

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

[9]  Jen-Shiang Chen,et al.  Model formulations for the machine scheduling problem with limited waiting time constraints , 2006 .

[10]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[11]  Zhibin Jiang,et al.  Combined scheduling algorithm for re-entrant batch-processing machines in semiconductor wafer manufacturing , 2015 .

[12]  Chen-Fu Chien,et al.  A novel timetabling algorithm for a furnace process for semiconductor fabrication with constrained waiting and frequency-based setups , 2007, OR Spectr..

[13]  Cheng-Shuo Wang.  Decomposition heuristics for complex job shop scheduling , 2000 .

[14]  J. Harrington,et al.  Dynamic Wet-Furnace Dispatching/Scheduling in Wafer Fab , 2006, The 17th Annual SEMI/IEEE ASMC 2006 Conference.

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

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

[17]  Kan Wu,et al.  Taxonomy of batch queueing models in manufacturing systems , 2014, Eur. J. Oper. Res..

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

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

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

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