Scheduling of wafer test processes in semiconductor manufacturing

This research focuses on solving a common wafer test scheduling problem in semiconductor manufacturing. During wafer testing, a series of test processes are conducted on wafers using computer-controlled test stations at various temperatures. The test processes are conducted in a specified order on a wafer lot, resulting in precedence constraints for the schedule. Furthermore, the assignment of the wafer lots to test stations and the sequence in which they are processed affects the time required to set up the test operations. Thus, the set-up times are sequence dependent. Four heuristics are developed to solve the test scheduling problem with the aim of minimizing the makespan required to test all wafers on a set of test stations. The heuristics generate a sorted list of wafer lots as a dispatching sequence and then schedule the wafer lots on test stations in order of appearance on the list. An experimental analysis and two case studies are presented to validate the proposed solution approaches. In the case studies, the heuristics are applied to actual data from a semiconductor manufacturing facility. For both case studies, the proposed solution approaches decrease the makespan by 23–45% compared with the makespan of the actual schedule executed in the manufacturing facility.

[1]  Reha Uzsoy,et al.  A shifting bottleneck algorithm for scheduling semiconductor testing operations , 1992 .

[2]  M.J. Riezenman,et al.  Test and measurement , 1994, IEEE Spectrum.

[3]  Reha Uzsoy,et al.  A review of production planning and scheduling models in the semiconductor industry , 1994 .

[4]  Edward A. Lee,et al.  Scheduling to Account for Interprocessor Communication within Interconnection-Constrained Processor Networks , 1990, International Conference on Parallel Processing.

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

[6]  S.-C. Huang,et al.  An interactive scheduler for a wafer probe centre in semiconductor manufacturing , 1998 .

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

[8]  T. Carmon-Freed Scheduling semiconductor device test operations , 1996, Nineteenth IEEE/CPMT International Electronics Manufacturing Technology Symposium.

[9]  Hesham El-Rewini,et al.  Scheduling Parallel Program Tasks onto Arbitrary Target Machines , 1990, J. Parallel Distributed Comput..

[10]  Shi-Chung Chang,et al.  Scheduling flexible flow shops with sequence-dependent setup effects , 2000, IEEE Trans. Robotics Autom..

[11]  Ad J. van de Goor,et al.  Semiconductor manufacturing process monitoring using built-in self-test for embedded memories , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).

[12]  C. Siva Ram Murthy,et al.  Scheduling Precedence Constrained Task Graphs with Non-Negligible Intertask Communication onto Multiprocessors , 1994, IEEE Trans. Parallel Distributed Syst..

[13]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[14]  MengChu Zhou,et al.  Scheduling of semiconductor test facility via Petri nets and hybrid heuristic search , 1998 .

[15]  John J. Kanet,et al.  Production scheduling: An interactive graphical approach , 1997, J. Syst. Softw..

[16]  Louis A. Martin-Vega,et al.  A DECOMPOSITION METHODOLOGY FOR SCHEDULING SEMICONDUCTOR TEST OPERATIONS FOR NUMBER OF TARDY JOB MEASURES , 1997 .

[17]  Tsu-Shuan Chang,et al.  Scheduling for IC sort and test with preemptiveness via Lagrangian relaxation , 1995, IEEE Trans. Syst. Man Cybern..

[18]  Reha Uzsoy,et al.  Exploiting shop floor status information to schedule complex job shops , 1994 .

[19]  Shu-Hsing Chung,et al.  A case study on the wafer probing scheduling problem , 2002 .

[20]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[21]  Hanif D. Sherali,et al.  Linear Programming and Network Flows , 1977 .

[22]  Reha Uzsoy,et al.  Production scheduling algorithms for a semiconductor test facility , 1991 .

[23]  R. C. Leachman,et al.  A production planning methodology for semiconductor manufacturing based on iterative simulation and linear programming calculations , 1996 .

[24]  Shu-Hsing Chung,et al.  Minimizing the total machine workload for the wafer probing scheduling problem , 2002 .

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

[26]  R. C. Leachman,et al.  Scheduling semiconductor device test operations on multihead testers , 1999 .

[27]  Reha Uzsoy,et al.  Scheduling semiconductor test operations: Minimizing maximum lateness and number of tardy jobs on a single machine , 1992 .

[28]  Reha Uzsoy,et al.  Decomposition methods for scheduling semiconductor testing facilities , 1996 .

[29]  Tsung-Rian Chen,et al.  Scheduling for IC sort and test facilities with precedence constraints via lagrangian relaxation , 1997 .

[30]  P. Simin Pulat,et al.  The shifting bottleneck procedure for job-shops with parallel machines , 2006 .

[31]  Shu-Hsing Chung,et al.  The wafer probing scheduling problem (WPSP) , 2002, J. Oper. Res. Soc..