A simulation study of new multi-objective composite dispatching rules, CONWIP, and push lot release in semiconductor fabrication

This paper evaluates dispatching rules and order release policies in two wafer fabrication facilities (thereafter referred to as ‘fab’) representing ASIC (application specific integrated circuit) and low-mix high-volume production. Order release policies were fixed-interval (push) release, and constant work-in-process (CONWIP) (pull) policy. Following rigorous fab modelling and statistical analysis, new composite dispatching rules were found to be robust for average and variance of flow time, as well as due-date adherence measures, in both production modes.

[1]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

[2]  Roberto Cigolini,et al.  Comparison of Order Review and Release techniques in a dynamic and uncertain job shop environment , 1998 .

[3]  Lee Dong-Ho,et al.  A SIMULATION STUDY ON LOT RELEASE CONTROL, MASK SCHEDULING, AND BATCH SCHEDULING IN SEMICONDUCTOR WAFER FABRICATION FACILITIES , 1998 .

[4]  Mauricio G. C. Resende,et al.  Closed-loop job release control for VLSI circuit manufacturing , 1988 .

[5]  R. G. Petrakian,et al.  Trade-offs in cycle time management: hot lots , 1992 .

[6]  Edward Anderson,et al.  Two new rules to minimize tardiness in a job shop , 1990 .

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

[8]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[9]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[10]  Oliver Rose,et al.  The shortest processing time first (SPTF) dispatch rule and some variants in semiconductor manufacturing , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[11]  Shang Zhi,et al.  A proof of the queueing formula: L=λW , 2001 .

[12]  Wallace J. Hopp,et al.  Setting WIP levels with statistical throughput control (STC) in CONWIP production lines , 1998 .

[13]  Lawrence M. Wein,et al.  A broader view of the job-shop scheduling problem , 1992 .

[14]  Manfred Mittler,et al.  Comparison of dispatching rules for semiconductor manufacturing using large facility models , 1999, WSC '99.

[15]  S. MacEachern.  The race is on. , 1983, Modern healthcare.

[16]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[17]  Gary L. Hogg,et al.  Workload control in the semiconductor industry , 2002 .

[18]  Krishna Srinivasan,et al.  Evaluation of lot release policies for semiconductor manufacturing systems , 1996, Winter Simulation Conference.

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

[20]  Lee W. Schruben,et al.  Operational modeling and simulation in semiconductor manufacturing , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[21]  John W. Fowler,et al.  Measurable improvements in cycle-time-constrained capacity , 1997, 1997 IEEE International Symposium on Semiconductor Manufacturing Conference Proceedings (Cat. No.97CH36023).

[22]  R. John Milne,et al.  A new method for order release , 1997 .

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

[24]  David L. Woodruff,et al.  CONWIP: a pull alternative to kanban , 1990 .

[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]  Ihsan Sabuncuoglu,et al.  An analysis of heuristics in a dynamic job shop with weighted tardiness objectives , 1999 .

[27]  Shekar Krishnaswamy,et al.  Implementing the theory of constraints philosophy in highly reentrant systems , 1998, 1998 Winter Simulation Conference. Proceedings (Cat. No.98CH36274).

[28]  L. Toothaker.  Multiple Comparisons for Researchers , 1991 .

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

[30]  T. S. Raghu,et al.  An efficient dynamic dispatching rule for scheduling in a job shop , 1993 .

[31]  Lawrence M. Wein,et al.  Scheduling semiconductor wafer fabrication , 1988 .

[32]  Izak Duenyas.  A Simple Release Policy for Networks of Queues with Controllable Inputs , 1994, Oper. Res..

[33]  Gavriel Salvendy,et al.  Handbook of industrial engineering , 2001 .

[34]  Jiyin Liu,et al.  Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling , 1993 .

[35]  R. Sandell,et al.  Evaluation of lot release policies for semiconductor manufacturing systems , 1996, Proceedings Winter Simulation Conference.

[36]  P. R. Kumar,et al.  Distributed scheduling based on due dates and buffer priorities , 1991 .

[37]  T. Teyner,et al.  Maintenance scheduling and staffing policies in a wafer fabrication facility , 1998, ICMTS 1998.

[38]  Heinrich Kuhn,et al.  Analysis of production control systems kanban and CONWIP , 1996 .

[39]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Multistation Closed Network , 1993, Oper. Res..

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

[41]  S.C.H. Lu,et al.  Efficient scheduling policies to reduce mean and variance of cycle-time in semiconductor manufacturing plants , 1994 .

[42]  D. J. Medeiros,et al.  OPERATIONAL MODELING & SIMULATION IN SEMICONDUCTOR MANUFACTURING , 1998 .

[43]  Lars Mönch,et al.  Improving the performance of dispatching rules in semiconductor manufacturing by iterative simulation , 2004, Proceedings of the 2004 Winter Simulation Conference, 2004..

[44]  Oliver Holthaus,et al.  Scheduling in job shops with machine breakdowns: an experimental study , 1999 .

[45]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .