A fast rescheduling method in semiconductor manufacturing allowing for tardiness and scheduling stability

In semiconductor manufacturing, rescheduling problems are extremely difficult to solve in real time due to the high frequency of disturbances that occur approximately every minute. This paper proposes a new approach to online manufacturing rescheduling. Unlike the traditional methods to have a scheduling process again, we (1) revise the existing schedule to keep high schedule stability based on message passing rescheduling with operation sorting; and (2) during the manufacturing process, improve the performance of the revised schedule with the introduction of a quick local search on semi-critical paths. In actual problems with about 200,000 processes, this method can effectively accommodate disturbances in less than 1 second, and a better schedule can be obtained in less than 1 minute. This method has been demonstrated to be more effective than conventional dispatching-rule methods, some of which have been actually applied in many facilities, because it offers higher schedule stability and fewer violations of due dates

[1]  Hark Hwang,et al.  Simplification methods for accelerating simulation-based real-time scheduling in a semiconductor wafer fabrication facility , 2003 .

[2]  Velusamy Subramaniam,et al.  mAOR: A heuristic-based reactive repair mechanism for job shop schedules , 2003 .

[3]  Appa Iyer Sivakumar,et al.  Job shop scheduling techniques in semiconductor manufacturing , 2006 .

[4]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[5]  Salvatore Cavalieri,et al.  A genetic algorithm for job-shop scheduling in a semiconductor manufacturing system , 1999, IECON'99. Conference Proceedings. 25th Annual Conference of the IEEE Industrial Electronics Society (Cat. No.99CH37029).

[6]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[7]  R. Hino,et al.  Message exchange method for decentralized scheduling , 2001, Proceedings of the 2001 IEEE International Symposium on Assembly and Task Planning (ISATP2001). Assembly and Disassembly in the Twenty-first Century. (Cat. No.01TH8560).

[8]  H. Toba Segment-based approach for real-time reactive rescheduling for automatic manufacturing control , 2000 .

[9]  John W. Fowler,et al.  A new scheduling approach using combined dispatching criteria in wafer fabs , 2003 .

[10]  Peter B. Luh,et al.  Scheduling of manufacturing systems using the Lagrangian relaxation technique , 1991, IEEE Trans. Autom. Control..

[11]  M. D. Johnston Reconciling high-speed scheduling with dispatching in wafer fabs , 2001, 2001 IEEE International Symposium on Semiconductor Manufacturing. ISSM 2001. Conference Proceedings (Cat. No.01CH37203).

[12]  J. A. Svestka,et al.  Rescheduling job shops under random disruptions , 1997 .

[13]  C. S. Sung,et al.  Minimizing makespan on a single burn-in oven in semiconductor manufacturing , 2000, Eur. J. Oper. Res..

[14]  Doo Yong Lee,et al.  Scheduling cluster tools in wafer fabrication using candidate list and simulated annealing , 1998, J. Intell. Manuf..