Skip to main content
Log in

Using an optimized queueing network model to support wafer fab design

  • Published:
IIE Transactions

Abstract

We develop an Optimized Queueing Network (OQNet) capacity planning tool for supporting the design of new and reconfigured semiconductor fabrication facilities that makes use of queueing network approximations and an optimization routine. The basic problem addressed by this tool is to minimize the facility cost required to meet specified volume and cycle time targets. Features common to semiconductor environments, such as batch processes, re-entrant flows, multiple product classes, and machine setups, are incorporated into the model. Comparisons with simulation show that the queueing and other approximations are reasonably accurate. Tests of the optimization routine demonstrate that it can find good solutions quickly.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Angelus, A., Porteus, E. and Wood, S. (1997) Optimal sizing and timing of capacity expansions with implications for modular semiconductor wafer fabs. Technical Report, School of Business, Stanford University, Stanford, CA.

    Google Scholar 

  • Avramidis, A.N., Healy, K.J. and Uzsoy, R. (1998) Control of a batch-processing machine: a computational approach. International Journal of Production Research, 36(11), 3167-3181.

    Google Scholar 

  • Bard, J.F., Srinivasan, K. and Tirupati, D. (1999) An optimization approach to capacity expansion in semiconductor manufacturing facilities. International Journal of Production Research, 37(5), 3359-3382.

    Google Scholar 

  • Boxma, O.J., Rinnooy Kan, A.H.G. and Van Vliet, M. (1990) Machine allocation problems in manufacturing networks. European Journal of Operational Research, 45, 47-54.

    Google Scholar 

  • Bitran, G.R. and Sarkar, D. (1994) Targeting problems in manufacturing queueing networks — an iterative scheme and convergence. European Journal of Operational Research, 76, 501-510.

    Google Scholar 

  • Bitran, G.R. and Tirupati, D. (1989a) Tradeoff curves, targeting and balancing in manufacturing. Operations Research, 37(4), 547-564.

    Google Scholar 

  • Bitran, G. and Tirupati, D. (1989b) Capacity planning in manufacturing networks with discrete options. Annals of Operations Research, 17, 119-135.

    Google Scholar 

  • Buzacott, J.A. and Shanthikumar, J.G. (1993) Stochastic Models of Manufacturing Systems, Prentice Hall, Englewood Cliffs, NJ.

    Google Scholar 

  • Chayet, S. and Hopp, W. (1998) Risk-sensitive strategic capacity planning. Technical Report, Department Industrial Engineering, Northwestern University, Evanston, IL.

    Google Scholar 

  • Chen, H., Harrison, J.M., Mandelbaum, A., Ackere, A.V. and Wein, L.M. (1998) Empirical evaluation of a queueing network model for semiconductor wafer fabrication. Operations Research, 36(2), 202-215.

    Google Scholar 

  • Connors, D.P., Fegin, G.E. and Yao, D.D. (1994) A queueing model for semiconductor manufacturing. Technical report, IBM Research Division, Yorktown Heights, NY.

    Google Scholar 

  • Dobson, G., Karmarkar, U.S. and Rummel, J.L. (1987) Batching to minimize flow times on one machine. Management Science, 33(6), 784-799.

    Google Scholar 

  • Dobson, G., Karmarkar, U.S. and Rummel, J.L. (1989) Batching to minimize flow times on parallel heterogeneous machines. Management Science, 35(5), 607-613.

    Google Scholar 

  • Donohue, K., Hopp, W. and Spearman, M. (2000) Optimal design of stochastic production lines: a dynamic programming approach. OMS Department Working Paper, University of Minnesota, Minneapolis, MN.

    Google Scholar 

  • Duenyas, I. and Neale, J. (1997) Stochastic scheduling of a batch processing machine with incompatible job families. Annals of Operations Research, 70, 191-220.

    Google Scholar 

  • Eppen, G., Martin, R. and Schrage, L. (1989) A scenario approach to capacity planning. Operations Research, 37, 517-527.

    Google Scholar 

  • Frenk, H., Labbe, M., Van Vliet, M. and Zhang, S. (1994) Improved algorithms for machine allocation in manufacturing systems. Operations Research, 42, 523-530.

    Google Scholar 

  • Freidenfelds, J. (1981) Capacity Expansion: Simple Models and Applications, North-Holland, Amsterdam.

    Google Scholar 

  • Hebuterne, G. and Rosenberg, C. (1999) Arrival and departure state distributions in the general bulk-service queue. Naval Research Logistics, 46(1), 107-118.

    Google Scholar 

  • Hopp, W.J. and Spearman, M.L. (2000) Factory Physics: Foundations of Manufacturing Management, 2nd edn, Irwin: McGraw-Hill, Burr-Ridge, IL.

    Google Scholar 

  • Karmarkar, U.S., Kekre, S. and Kekre, S. (1992) Multi-item batching heuristics for minimization of queueing delays. European Journal of Operational Research, 58(1), 99-111.

    Google Scholar 

  • Kuik, R. and Tielemans, P.F.J. (1999) Lead time variability in a homogeneous queueing model. International Journal of Production Research, 59(1/3), 435-441.

    Google Scholar 

  • Kouvelis, P. and Tirupati, D. (1991) Approximate performance modeling and decision making for manufacturing systems: a queueing network optimization framework. Journal of Intelligent Manufacturing, 2, 107-134.

    Google Scholar 

  • Luss, H. (1982) Operations research and capacity expansion problems: a survey. Operations Research, 30, 907-947.

    Google Scholar 

  • Neale, J. and Duenyas, I. (2000) Control of manufacturing networks which contain a batch processing machine. IIE Transactions, 32, 1027-1041.

    Google Scholar 

  • Neale, J. and Duenyas, I. (2001) Control of a batch processing machine serving compatible job families. Working paper, University of Michigan Business School, Ann Arbor, MI 48109.

    Google Scholar 

  • Potts, C. and Kovalyov, M.Y. (2000) Scheduling with batching: a review. European Journal of Operational Research, 120(2), 228-249.

    Google Scholar 

  • Powell, W. (1986a) Iterative algorithms for bulk arrival bulk service queues and non-Poisson arrivals. Transportation Science, 20(2), 65-79.

    Google Scholar 

  • Powell, W. (1986b) The bulk service queue with general control strategy: theoretical analysis and a new computational procedure. Operations Research, 34(2), 267-275.

    Google Scholar 

  • Segal, M. and Whitt, W. (1989) A queuing network analyzer for manufacturing, in Teletraffic Science for New Cost-Effective Systems, Networks and Services, ITC-12, Bonati, M. (ed), Elsevier-Science, New York, pp. 1146-1152.

    Google Scholar 

  • Van Ommeren, J.C.W. (1990) Simple approximations for the batch-arrival M x/G/1 queue. Operations Research, 38(4), 678-685.

    Google Scholar 

  • Van Vliet, M. and Rinnooy Kan, A. (1991) Machine allocation algorithms for job shop manufacturing. Journal of Intelligent Manufacturing, 2, 83-94.

    Google Scholar 

  • Walrand, J. (1993) Queueing networks, in Handbooks in Operations Research and Management Science, Vol. 2: Stochastic Models, Heyman, D.P. and Sobel, M.J. (eds), North Holland, New York, pp. 519-603.

    Google Scholar 

  • Whitt, W. (1983) The queueing network analyzer. The Bell System Technical Journal, 62(9), 2279-2815.

    Google Scholar 

  • Whitt, W. (1993) Approximations for the GI/G/m queue. Production and Operations Management, 2(2), 114-161.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hopp, W.J., Spearman, M.L., Chayet, S. et al. Using an optimized queueing network model to support wafer fab design. IIE Transactions 34, 119–130 (2002). https://doi.org/10.1023/A:1011987712718

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011987712718

Keywords

Navigation