Daily scheduling of multi-pass lots at assembly and test facilities

In semiconductor manufacturing, wafers are grouped into lots and sent to a separate facility for assembly and test before being shipped to the customer. This paper investigates the daily scheduling of such lots in a re-entrant flow environment where it is necessary to plan for several passes of the same lot through the system. Up to a dozen operations are required during assembly and test and many are performed by the same equipment. Work in process lots that have more than a single step remaining in their route are referred to as multi-pass lots. The scheduling problem is to determine machine setups, lot assignments, and lot sequences to achieve optimal output, as measured by four objectives related to key device shortages, throughput, machine utilisation, and makespan, in that order. When more than a single pass is considered, it is not possible to develop an efficient mathematical model to represent the decision process. To find solutions, we take a multi-stage approach, first applying a reactive greedy randomised search procedure (GRASP) to develop a schedule for the current lots waiting to be processed, and then using a similar procedure to schedule additional passes and changeovers. The performance of the methodology is evaluated using data provided by a leading semiconductor manufacturer for instances with up to 36 machines, 284 tooling pieces from six families, and 1036 lots. The results indicate that, on average, multi-pass scheduling improves the weighted sum of lots processed by 40% and machine utilisation by 11% compared to the results obtained with the single-pass algorithm.

[1]  Lionel Amodeo,et al.  New multi-objective method to solve reentrant hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[2]  Wieslaw Kubiak,et al.  Mean Flow Time Minimization in Reentrant Job Shops with a Hub , 1996, Oper. Res..

[3]  Lin Danping,et al.  A review of the research methodology for the re-entrant scheduling problem , 2011 .

[4]  R. Ramesh,et al.  Cyclic scheduling heuristics for a re-entrant job shop manufacturing environment , 2001 .

[5]  Jonathan F. Bard,et al.  A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs , 2008, Eur. J. Oper. Res..

[6]  Carlos F. Bispo,et al.  Managing Simple re-entrant Flow Lines: Theoretical Foundation and Experimental Results , 2001 .

[7]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[8]  Reha Uzsoy,et al.  Decomposition methods for reentrant flow shops with sequence‐dependent setup times , 2000 .

[9]  Y. Narahari,et al.  Performance analysis of scheduling policies in re-entrant manufacturing systems , 1996, Comput. Oper. Res..

[10]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[11]  Dong-Ho Lee,et al.  Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line , 2011, Expert Syst. Appl..

[12]  Chi-Hyuck Jun,et al.  Performance evaluation of re-entrant lines with multi-class jobs and multi-server workstations , 2002 .

[13]  Toshiya Kaihara,et al.  A proposal on optimized scheduling methodology and its application to an actual-scale semiconductor manufacturing problem , 2012 .

[14]  J F Bard,et al.  Midterm Planning to Minimize Deviations From Daily Target Outputs in Semiconductor Manufacturing , 2010, IEEE Transactions on Semiconductor Manufacturing.

[15]  Yumin Deng,et al.  Scheduling Back-End Operations in Semiconductor Manufacturing , 2010, IEEE Transactions on Semiconductor Manufacturing.

[16]  John W. Fowler,et al.  Real-time control of multiproduct bulk-service semiconductor manufacturing processes , 1992 .

[17]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .

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