Queueing Theory for Semiconductor Manufacturing Systems: A Survey and Open Problems

This paper surveys applications of queueing theory for semiconductor manufacturing systems (SMSs). Due to sophisticated tool specifications and process flows in semiconductor manufacturing, queueing models can be very complicated. Research efforts have been on the improvement of model assumptions and model input, mainly in the first moment (averages) and the second moment (variations). However, practices show that implementation of classical queueing theory in semiconductor industry has been unsatisfactory. In this paper, open problems on queueing modeling of SMS are discussed. A potential solution is also proposed by relaxing the independent assumptions in the classical queueing theory. Cycle time reduction has constantly been a key focus of semiconductor manufacturing. Compared with simulation, queueing theory-based analytical modeling is much faster in estimating manufacturing system performance and providing more insights for performance improvement. Therefore, queueing modeling attracts generous semiconductor research grants. Unfortunately, existing queueing models focus on simple extensions of the classical queueing theory and fail to question its applicability to the complicated SMS. Hence, related researches have not been employed widely in the semiconductor industry. In this paper, we conduct a survey on the important works and also present some open problems. We also propose a novel solution by relaxing a key assumption in the classical queueing theory. We are currently funded by Intel to explore this potential solution, and we hope it can foster an interesting research field for the years to come.

[1]  Ming-Der Hu,et al.  Translating overall production goals into distributed flow control parameters for semiconductor manufacturing , 2003 .

[2]  P. R. Kumar,et al.  Re-entrant lines , 1993, Queueing Syst. Theory Appl..

[3]  Tayfur Altiok,et al.  The Case for Modeling Correlation in Manufacturing Systems , 2001 .

[4]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[5]  Jingshan Li,et al.  Overlapping decomposition: a system-theoretic method for modeling and analysis of complex manufacturing systems , 2005, IEEE Transactions on Automation Science and Engineering.

[6]  Stanley B. Gershwin,et al.  Models and solving procedures for continuous-time production planning , 2000 .

[7]  Martin I. Reiman,et al.  Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..

[8]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1995, IEEE Trans. Autom. Control..

[9]  D. Martin,et al.  How the law of unanticipated consequences can nullify the theory of constraints: The case for balanced capacity in a semiconductor manufacturing line , 1997, 1997 IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop ASMC 97 Proceedings.

[10]  Yi-Feng Hung,et al.  Using an empirical queueing approach to predict future flow times , 1999 .

[11]  J. A. Buzacott,et al.  The time spent in a dynamic job shop , 1984 .

[12]  Gang Meng,et al.  Batch size modeling in a multi-item, discrete manufacturing system via an open queuing network , 2004 .

[13]  Hong Chen,et al.  Empirical Evaluation of a Queueing Network Model for Semiconductor Wafer Fabrication , 1988, Oper. Res..

[14]  Hong Chen,et al.  Brownian Approximations of Multiclass Open-Queueing Networks , 2002, Oper. Res..

[15]  Fumiaki Machihara.  A BMAP/SM/1 queue with service times depending on the arrival process , 1999, Queueing Syst. Theory Appl..

[16]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[17]  J. Michael Harrison,et al.  Brownian models of multiclass queueing networks: Current status and open problems , 1993, Queueing Syst. Theory Appl..

[18]  P. Kuehn,et al.  Approximate Analysis of General Queuing Networks by Decomposition , 1979, IEEE Trans. Commun..

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

[20]  Chen-Fu Chien,et al.  Cycle time prediction and control based on production line status and manufacturing data mining , 2005, ISSM 2005, IEEE International Symposium on Semiconductor Manufacturing, 2005..

[21]  Stanley B. Gershwin.  Design and operation of manufacturing systems: the control-point policy , 2000 .

[22]  David D. Yao,et al.  A queueing network model for semiconductor manufacturing , 1996 .

[23]  David D. Yao,et al.  Scheduling semiconductor lines using a fluid network model , 1994, IEEE Trans. Robotics Autom..

[24]  Miron Livny,et al.  The Impact of Autocorrelation on Queuing Systems , 1993 .

[25]  Isi Mitrani,et al.  Limiting results for multiprocessor systems with breakdowns and repairs , 1993, Queueing Syst. Theory Appl..

[26]  Bryan L. Deuermeyer,et al.  Renewal approximations for the departure processes of batch systems , 2002 .

[27]  B. Avi-Itzhak,et al.  A Many-Server Queue with Service Interruptions , 1968, Oper. Res..

[28]  Ruth J. Williams,et al.  Brownian Models of Open Queueing Networks with Homogeneous Customer Populations , 1987 .

[29]  Kan Wu,et al.  An examination of variability and its basic properties for a factory , 2005, IEEE Transactions on Semiconductor Manufacturing.

[30]  P. Backus,et al.  Factory cycle-time prediction with a data-mining approach , 2006, IEEE Transactions on Semiconductor Manufacturing.

[31]  Wallace J. Hopp,et al.  Factory physics : foundations of manufacturing management , 1996 .

[32]  J. Harrison,et al.  Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis , 1992 .

[33]  Michael T. Pich,et al.  Two-Moment Analysis of Open Queueing Networks with General Workstation Capabilities , 1996, Oper. Res..

[34]  Ward Whitt,et al.  Variability functions for parametric-decomposition approximations of queueing networks , 1995 .

[35]  P. Kumar,et al.  The throughput of irreducible closed Markovian queueing networks: functional bounds, asymptotic loss, efficiency, and the Harrison-Wein conjectures , 1997 .

[36]  Gabriel R. Bitran,et al.  A review of open queueing network models of manufacturing systems , 1992, Queueing Syst. Theory Appl..

[37]  B. Grigsby,et al.  Throughput time forecasting model , 1997, 1997 IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop ASMC 97 Proceedings.

[38]  J. Harrison,et al.  Reflected Brownian Motion on an Orthant , 1981 .

[39]  Jacobus E. Rooda,et al.  Characterization of operational time variability using effective process times , 2003 .

[40]  Erol Gelenbe,et al.  Analysis and Synthesis of Computer Systems , 1980 .

[41]  C. Zhou,et al.  The QNET Method for Re-Entrant Queueing Networks with Priority Disciplines , 1997, Oper. Res..

[42]  J. A. Buzacott.  The Effect Of Queue Discipline On The Capacity Of Oueues With Service Time Dependent On Waiting Times , 1974 .

[43]  Sunkyo Kim.  Approximation of multiclass queueing networks with highly variable arrivals under deterministic routing , 2005 .

[44]  J. A. Buzacott,et al.  Open queueing network models of dynamic job shops , 1981 .

[45]  John Miltenburg,et al.  Analysis of wafer fabrication facilities using four variations of the open queueing network decomposition model , 2002 .

[46]  J. George Shanthikumar,et al.  Some Pitfalls of Black Box Queue Inference: The Case of State-Dependent Server Queues , 1993 .

[47]  Ward Whitt,et al.  Dependence in packet queues , 1989, IEEE Trans. Commun..

[48]  Gerald T. Mackulak,et al.  D-Optimal Sequential Experiments for Generating a Simulation-Based Cycle Time-Throughput Curve , 2002, Oper. Res..

[49]  Hong Chen,et al.  Dynamic Scheduling of a Multiclass Fluid Network , 1993, Oper. Res..

[50]  J.H. Jacobs,et al.  Quantifying variability of batching equipment using effective process times , 2006, IEEE Transactions on Semiconductor Manufacturing.

[51]  Sunil Kumar.  Two-server closed networks in heavy traffic: diffusion limits and asymptotic optimality , 2000 .

[52]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[53]  J. Michael Harrison,et al.  The QNET method for two-moment analysis of open queueing networks , 1990, Queueing Syst. Theory Appl..

[54]  David D. Yao,et al.  Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control , 1992, Oper. Res..

[55]  W. Hopp,et al.  Using an optimized queueing network model to support wafer fab design , 2002 .

[56]  James R. Jackson,et al.  Jobshop-Like Queueing Systems , 2004, Manag. Sci..

[57]  John N. Tsitsiklis,et al.  Optimization of multiclass queuing networks: polyhedral and nonlinear characterizations of achievable performance , 1994 .

[58]  Lawrence M. Wein,et al.  Scheduling Networks of Queues: Heavy Traffic Analysis of a Two-Station Closed Network , 1990, Oper. Res..

[59]  John Frank Charles Kingman,et al.  The single server queue in heavy traffic , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.

[60]  Ying-Chyi Chou,et al.  Analytic approximations for multiserver batch-service workstations with multiple process recipes in semiconductor wafer fabrication , 2001 .

[61]  B. W. Conolly,et al.  The Waiting Time Process for a Certain Correlated Queue , 1968, Oper. Res..

[62]  P. R. Kumar,et al.  Performance bounds for queueing networks and scheduling policies , 1994, IEEE Trans. Autom. Control..

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

[64]  James R. Morrison,et al.  Practical Extensions to Cycle Time Approximations for the $G/G/m$-Queue With Applications , 2007, IEEE Transactions on Automation Science and Engineering.