• DocumentCode
    2060694
  • Title

    A queuing network model for wafer fabrication using decomposition without aggregation

  • Author

    Grosbard, Dean ; Kalir, Adar ; Tirkel, Israel ; Rabinowitz, Gad

  • Author_Institution
    Intel Corp., Qiriat-Gat, Israel
  • fYear
    2013
  • fDate
    17-20 Aug. 2013
  • Firstpage
    717
  • Lastpage
    722
  • Abstract
    Deterministic capacity models and simulation models cannot fully comprehend the modern wafer fabrication facility´s need for cycle time (CT) forecasts that are both accurate and rapid. Queuing networks, being stochastic yet analytical models, have the potential of providing sufficiently accurate `on the spot´ CT approximations. In this paper, we characterize a queuing network suited for fab modeling and then formulate a queuing network model for a mini-fab, using decomposition without aggregation method to yield CT approximations. Numerical results demonstrate that this proposed approach generates fairly accurate approximations with an average error of 7% compared to simulation results, better than other existing methods to date.
  • Keywords
    approximation theory; forecasting theory; queueing theory; semiconductor device manufacture; stochastic programming; work in progress; aggregation; analytical model; cycle time forecasting; decomposition; deterministic capacity models; on-the-spot CT approximations; queuing network model; stochastic model; wafer fabrication; Analytical models; Approximation methods; Mathematical model; Production; Routing; Semiconductor device modeling;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Automation Science and Engineering (CASE), 2013 IEEE International Conference on
  • Conference_Location
    Madison, WI
  • ISSN
    2161-8070
  • Type

    conf

  • DOI
    10.1109/CoASE.2013.6653941
  • Filename
    6653941