Decomposition without aggregation for performance approximation in queueing network models of semiconductor manufacturing

References

• Bitran, G. R., and D. Tirupati. 1988. “Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference.” Management Science 34 (1): 75–100. doi: 10.1287/mnsc.34.1.75
   Web of Science ®Google Scholar
• Burke, P. J. 1968. “The Output Process of a Stationary M/M/s Queueing System.” Annals of Mathematical Statistics 39 (4): 1144–1152. doi: 10.1214/aoms/1177698238
   Google Scholar
• Connors, D. P., G. E. Feigin, and D. D. Yao. 1996. “A Queueing Network Model for Semiconductor Manufacturing.” IEEE Transactions on Semiconductor Manufacturing 9 (3): 412–427. doi: 10.1109/66.536112
   Web of Science ®Google Scholar
• Fowler, J. W., and J. Robinson. 1995. “Measurement and Improvement of Manufacturing Capacity (MIMAC): Final Report.” #95062861A-TR. SEMATECH, Technology Transfer.
   Google Scholar
• Furmans, K., Liberopoulos, G., Rimmele, M., and Zimmermann, O. 2017. “Review of Models for Large Scale Manufacturing Networks.” Proceedings 11th conference on stochastic modeling of manufacturing and service operations (SMMSO 2017), 251–260.
   Google Scholar
• Global Semiconductor Forum. 2011. Elpida Memory 300 mm Wafer Fab, Hiroshima, Japan. http://www.semiconductor-technology.com/projects/elpida.
   Google Scholar
• Grosbard, D., A. Kalir, I. Tirkel, and G. Rabinowitz. 2013. “A Queuing Network Model for Wafer Fabrication Using Decomposition Without Aggregation.” Automation Science and Engineering (CASE), 2013 IEEE International Conference on. IEEE, 717–722.
   Google Scholar
• Hopp, W. J., M. L. Spearman, S. Chayet, K. L. Donohue, and E. S. Gel. 2002. “Using an Optimized Queueing Network Model to Support Wafer Fab Design.” Iie Transactions 34 (2): 119–130.
   Web of Science ®Google Scholar
• Kim, S. 2005. “Approximation of Multiclass Queueing Networks with Highly Variable Arrivals under Deterministic Routing.” Naval Research Logistics 52 (5): 399–408. doi: 10.1002/nav.20085
   Web of Science ®Google Scholar
• Kuehn, P. 1979. “Approximate Analysis of General Queuing Networks by Decomposition.” IEEE Transactions on Communications 27 (1): 113–126. doi: 10.1109/TCOM.1979.1094270
   Web of Science ®Google Scholar
• Lapedus, M. 2010. “EUV Tool Costs Hit $120 Million.” http://www.eetimes.com/document.asp?doc_id=1257963.
   Google Scholar
• Mirasol, N. M. 1963. “The Output of an M/G/∞ Queueing System is Poisson.” Operations Research 11: 282–284. doi: 10.1287/opre.11.2.282
   Web of Science ®Google Scholar
• Pradhan, S., P. Damodaran, and K. Srihari. 2008. “Predicting Performance Measures for Markovian Type of Manufacturing Systems with Product Failures.” European Journal of Operational Research 184 (2): 725–744. doi: 10.1016/j.ejor.2006.11.016
   Web of Science ®Google Scholar
• Sagron, R., D. Grosbard, G. Rabinowitz, and I. Tirkel. 2015. “Approximation of Single-class Queueing Networks with Downtime-induced Traffic Variability.” International Journal of Production Research 53 (13): 3871–3887. doi: 10.1080/00207543.2014.974845
   Web of Science ®Google Scholar
• Shanthikumar, J. G., and J. A. Buzacott. 1981. “Open Queueing Network Models of Dynamic Job Shops.” International Journal of Production Research 19 (3): 255–266. doi: 10.1080/00207548108956652
   Web of Science ®Google Scholar
• Shanthikumar, J. G., S. Ding, and M. T. Zhang. 2007. “Queueing Theory for Semiconductor Manufacturing Systems: A Survey and Open Problems.” IEEE Transactions on Automation Science and Engineering 4 (4): 513–522. doi: 10.1109/TASE.2007.906348
   Web of Science ®Google Scholar
• Shin, J., J. R. Morrison, D. Grosbard, and A. Kalir. 2016. “Mean Cycle Time Approximations for G/G/M Queueing Networks Using Decomposition Without Aggregation with Application to Fab Datasets.” Proceedings of the 2016 winter simulation conference. IEEE Press, 2685–2696.
   Google Scholar
• Suresh, S., and W. Whitt. 1990. “The Heavy-traffic Bottleneck Phenomenon in Open Queueing Networks.” Operations Research Letters 9 (6): 355–362. doi: 10.1016/0167-6377(90)90054-9
   Web of Science ®Google Scholar
• Whitt, W. 1983. “The Queueing Network Analyzer.” Bell System Technical Journal 62 (9): 2779–2815. doi: 10.1002/j.1538-7305.1983.tb03204.x
   Google Scholar
• Whitt, W. 1984. “Departures from a Queue with Many Busy Servers.” Mathematics of Operations Research 9 (4): 534–544. doi: 10.1287/moor.9.4.534
   Web of Science ®Google Scholar
• Whitt, W. 1988. “A Light-traffic Approximation for Single-class Departure Processes from Multi-class Queue.” Management Science 34: 1333–1346. doi: 10.1287/mnsc.34.11.1333
   Web of Science ®Google Scholar
• Whitt, W. 1994. “Towards Better Multi-class Parametric-decomposition Approximations for Open Queueing Networks.” Annals of Operations Research 48 (3): 221–248. doi: 10.1007/BF02024659
   Web of Science ®Google Scholar
• Whitt, W. 1995. “Variability Functions for Parametric-decomposition Approximations of Queueing Networks.” Management Science 41 (10): 1704–1715. doi: 10.1287/mnsc.41.10.1704
   Web of Science ®Google Scholar
• Wu, K. 2014. “Classification of Queueing Models for a Workstation with Interruptions: A Review.” International Journal of Production Research 52 (3): 902–917. doi: 10.1080/00207543.2013.843799
   Web of Science ®Google Scholar