A Markov Chain Framework for Cycle Time Approximation of Toolsets
| Autor: | J. George Shanthikumar, Yahya Fathi, Raha Akhavan-Tabatabaei |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Queueing theory
Markov kernel Markov chain Computer science Variable-order Markov model Markov process Condensed Matter Physics Industrial engineering Industrial and Manufacturing Engineering Electronic Optical and Magnetic Materials Quasi-birth–death process symbols.namesake Layered queueing network Econometrics symbols Electrical and Electronic Engineering Discrete event simulation |
| Zdroj: | IEEE Transactions on Semiconductor Manufacturing. 25:589-597 |
| ISSN: | 1558-2345 0894-6507 |
| Popis: | Cycle time is a key performance measure in semiconductor manufacturing. Currently, discrete event simulation and queueing theory are the most common approaches to estimating the cycle time of a fabrication facility. However, the performance of both approaches has been unsatisfactory due to many factors, including the inability to perform in an environment where informal and unwritten operational rules exist. Such rules create dependence between the arrival and service processes of a toolset, and, hence, render the classical queueing models inaccurate. We propose a Markov chain framework that attempts to approximate the cycle time of a toolset in the presence of informal operational rules, and we compare our approach with classical queueing models through a series of numerical examples. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|