Optimization of Re-Entrant Hybrid Flows With Multiple Queue Time Constraints in Batch Processes of Semiconductor Manufacturing

This paper proposes optimization methods of re-entrant hybrid flows with multiple queue time constraints in batch processes of semiconductor manufacturing. A smoothing flow concept and a dispatching rule for the re-entrant flows called “re-entrant flow smoothing” [REFS(X)] and a loading rule for the processes with multiple queue time constraints called “synchronized control of kanban and buffer sizes” (SCKB) were developed and evaluated. These optimization methods aimed to both maximize the throughput ratio of quality products and minimize the lead time of work-in-process. A three-view modeling to combine the objective functions was created to respond to an actual problem scale. For a manufacturing process consisting of five flows and four re-entrant flows with seven queue time constraints, SCKB-REFS(X) improved the throughput ratio of the quality products by 20.0% compared with first-come first-served (FCFS)-conditional time in 40 days. The mean lead time was also shortened by 60.1% because SCKB-REFS(X) could reduce the setup rate by 83.1% and improve the overall equipment effectiveness by 41.9%, though the performance of minimum inventory variability scheduler application rules is almost the same as that of basic FCFS. REFS-SCKB(X) computed the problem in 4 s or less.

[1]  K. Yasuda,et al.  Distributive and Cooperative Scheduling Considering Multi-Attribute Product-Mix, Feedback Process, and the Dynamic Utility Control-in Resource Sharing , 2006, 2006 IEEE International Symposium on Semiconductor Manufacturing.

[2]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[3]  Oliver Rose,et al.  Cycle time variance minimization for WIP balance approaches in wafer fabs , 2013, 2013 Winter Simulations Conference (WSC).

[4]  W. Marsden I and J , 2012 .

[5]  Yeong-Dae Kim,et al.  Minimizing makespan on an m-machine re-entrant flowshop , 2008, Comput. Oper. Res..

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

[7]  Kazuyuki Saito,et al.  Operator Allocation Planning for a Product-Mix VLSI Assembly Facility , 2001 .

[8]  Peter B. Luh,et al.  Optimal wet-furnace machine allocation for daily fab production , 2010, 2010 International Symposium on Semiconductor Manufacturing (ISSM).

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

[10]  Karl G. Kempf,et al.  Decision Policies for Production Networks , 2012 .

[11]  Jatinder N. D. Gupta,et al.  Two-Stage, Hybrid Flowshop Scheduling Problem , 1988 .

[12]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[13]  Jingshan Li,et al.  Scheduling policies in multi-product manufacturing systems with sequence-dependent setup times and finite buffers , 2012 .

[14]  William H. Press,et al.  Numerical recipes in C , 2002 .

[15]  T. Inoue,et al.  Study of cycle time caused by lot arrival distribution in a semiconductor manufacturing line , 2005, ISSM 2005, IEEE International Symposium on Semiconductor Manufacturing, 2005..

[16]  L. W. Jacobs,et al.  Note: A local-search heuristic for large set-covering problems , 1995 .

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

[18]  Kuo-Ching Ying,et al.  Scheduling identical wafer sorting parallel machines with sequence-dependent setup times using an iterated greedy heuristic , 2012 .

[19]  Shu Li,et al.  Minimum inventory variability schedule with applications in semiconductor fabrication , 1996 .

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

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

[22]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[23]  D. W. Collins,et al.  An analysis of the "K-step ahead" minimum inventory variability policy(R) using SEMATECH semiconductor manufacturing data in a discrete-event simulation model , 1997, 1997 IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, EFTA '97.

[24]  Gupta J.N.D. TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[25]  Myoungsoo Ham,et al.  Dynamic photo stepper dispatching/scheduling in wafer fabrication , 2005, ISSM 2005, IEEE International Symposium on Semiconductor Manufacturing, 2005..

[26]  Erik Hertzler,et al.  300mm Time Constrained Queue Loop Management , 2006, 2006 IEEE International Symposium on Semiconductor Manufacturing.

[27]  Daniel E. Rivera,et al.  A model predictive control approach for real-time optimization of reentrant manufacturing lines , 2001, Comput. Ind..

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

[29]  Yih-Yi Lee,et al.  Reaction chain of process queue time quality control , 2005, ISSM 2005, IEEE International Symposium on Semiconductor Manufacturing, 2005..

[30]  S. Arima,et al.  A simulation study on periodical priority dispatching of WIP for product-mix fabrication , 2002, 13th Annual IEEE/SEMI Advanced Semiconductor Manufacturing Conference. Advancing the Science and Technology of Semiconductor Manufacturing. ASMC 2002 (Cat. No.02CH37259).

[31]  Chih-Ming Liu,et al.  Standard WIP Determination and WIP Balance Control with Time Constraints in Semiconductor Wafer Fabrication , 2008 .

[32]  Rubén Ruiz,et al.  The hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..