An assignment-sequencing methodology for scheduling assembly and test operations with multi-pass requirements

This article presents a three-phase methodology for scheduling assembly and test operations for semiconductor devices. The facility in which these operations are performed is a re-entrant flow shop consisting of several dozen to several hundred machines and up to a 1000 specialized tools. The semiconductor devices are contained in lots, and each lot follows a specific route through the facility, perhaps returning to the same machine multiple times. Each step in the route is referred to as a “pass.” In the first phase of the methodology an extended assignment model is solved to simultaneously assign tooling and lots to the machines. Four prioritized objectives are considered: minimize the weighted sum of key device shortages, maximize the weighted sum of lots processed, minimize the number of machines used, and minimize the makespan. In the second phase, lots are optimally sequenced on their assigned machines using the same prioritized objectives. Due to the precedent relations induced by the pass requirements, some lots may have to be delayed or removed from the assignment model solution to ensure that no machine runs beyond the planning horizon. In the third phase, machines are reset to allow additional lots to be processed when tooling is available. The methodology was tested using data provided by the Assembly and Test facility of a leading manufacturer. The results indicate that high-quality solutions can be obtained within 1 hour when compared with those obtained with a greedy randomized adaptive search procedure. Cost reductions were observed across all objectives and averaged 62% in the aggregate.

[1]  W. L. Pearna,et al.  A case study on the multistage IC final testing scheduling problem with reentry , 2004 .

[2]  Reha Uzsoy,et al.  Decomposition algorithms for scheduling semiconductor testing facilities , 1995, Seventeenth IEEE/CPMT International Electronics Manufacturing Technology Symposium. 'Manufacturing Technologies - Present and Future'.

[3]  Hark Hwang,et al.  Production sequencing problem with reentrant work flows and sequence dependent setup times , 1997 .

[4]  Chien-Min Lin,et al.  A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem , 2008, Expert Syst. Appl..

[5]  Yeong-Dae Kim,et al.  A Due-Date-Based Algorithm for Lot-Order Assignment in a Semiconductor Wafer Fabrication Facility , 2008, IEEE Transactions on Semiconductor Manufacturing.

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

[7]  Tae-Eog Lee,et al.  Scheduling single-armed cluster tools with reentrant wafer flows , 2006, IEEE Transactions on Semiconductor Manufacturing.

[8]  Brian Denton,et al.  Optimization of surgery sequencing and scheduling decisions under uncertainty , 2007, Health care management science.

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

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  Reha Uzsoy,et al.  Decomposition Methods for Complex Factory Scheduling Problems , 1996 .

[12]  Joseph B. Mazzola,et al.  Resource-Constrained Assignment Scheduling , 1986, Oper. Res..

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

[14]  Reha Uzsoy,et al.  Performance of decomposition methods for complex workshops under multiple criteria , 1997 .

[15]  Ignacio E. Grossmann,et al.  Assignment and sequencing models for thescheduling of process systems , 1998, Ann. Oper. Res..

[16]  Jonathan F. Bard,et al.  Daily scheduling of multi-pass lots at assembly and test facilities , 2013 .

[17]  Jonathan F. Bard,et al.  Equipment Selection and Machine Scheduling in General Mail Facilities , 1994 .

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

[19]  Jen-Shiang Chen,et al.  Hybrid tabu search for re-entrant permutation flow-shop scheduling problem , 2008, Expert Syst. Appl..

[20]  Jonathan F. Bard,et al.  The task assignment problem for unrestricted movement between workstation groups , 2006, J. Sched..

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

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