Mean cycle time approximations for G/G/m queueing networks using decomposition without aggregation with application to fab datasets

Jinho Shin, James R. Morrison, Dean Grosbard, Adar Kalir

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

The modern semiconductor fabricator needs both accurate and fast cycle time (CT) forecasts. Due to complexity of development and computational intractability, simulation may be supplemented by queueing network methods. In this paper, we develop extensions to approximation methods for queueing networks that are suited for fab modeling using decomposition without aggregation. We conduct simulation experiments based on a semiconductor industry-inspired dataset. For sensitivity analysis, we mainly focus on the interarrival distribution, service time distributions, and bottleneck toolset loading. The results show that the approximations predict the total CT fairly well in various cases.

Original languageEnglish
Title of host publication2016 Winter Simulation Conference
Subtitle of host publicationSimulating Complex Service Systems, WSC 2016
EditorsTheresa M. Roeder, Peter I. Frazier, Robert Szechtman, Enlu Zhou
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2685-2696
Number of pages12
ISBN (Electronic)9781509044863
DOIs
StatePublished - Jul 2 2016
Event2016 Winter Simulation Conference, WSC 2016 - Arlington, United States
Duration: Dec 11 2016Dec 14 2016

Publication series

NameProceedings - Winter Simulation Conference
Volume0
ISSN (Print)0891-7736

Conference

Conference2016 Winter Simulation Conference, WSC 2016
Country/TerritoryUnited States
CityArlington
Period12/11/1612/14/16

Fingerprint

Dive into the research topics of 'Mean cycle time approximations for G/G/m queueing networks using decomposition without aggregation with application to fab datasets'. Together they form a unique fingerprint.

Cite this