A queueing network based system to model capacity and cycle time for semiconductor fabrication

Proceedings - Winter Simulation Conference

Volumn , Issue , 2008, Pages 2067-2074

  Zisgen, Horst ^a   Meents, Ingo ^a   Wheeler, Benjamin R ^b   Hanschke, Thomas ^c  

^a IBM   (Germany)

^b IBM MICROELECTRONICS   (United States)

^c CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION PLANS; ANALYTICAL MODELS; COMPLEX ENVIRONMENTS; CYCLE TIME; DISCRETE-EVENT SIMULATIONS; ENTERPRISE PRODUCTIONS; NETWORK-BASED SYSTEMS; OPERATIONAL PERFORMANCE; OPTIMIZATION SYSTEMS; PLANNING TASKS; PRODUCT MIXES; QUEUEING MODELS; RESPONSE TIME; SEMI-CONDUCTOR FABRICATIONS; SEMICONDUCTOR BUSINESS; SEMICONDUCTOR MANUFACTURING SYSTEMS;

DISCRETE EVENT SIMULATION; ELECTRIC CONDUCTIVITY; PLANNING; PRODUCTION CONTROL; QUEUEING THEORY; SEMICONDUCTING INDIUM; SEMICONDUCTOR MATERIALS;

QUEUEING NETWORKS;

EID: 60749118321     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2008.4736303     Document Type: Conference Paper

References (16)

1. Bermon, S., and S, Hood. 1999. Capacity optimization planning system (CAPS). Interfaces 29 (5): 31-50.
2. Bitran, G., and D. Tirupati. 1989. Approximations for product departures from a single-server station with batch processing in multi-product queues. Management Science 35:851-878.
3. Chaudhry, M., and J. Templeton. 1983. A first course in bulk queues. New York: John Wiley & Sons.
4. Chiamsiri, S., and M. Leonard. 1981. A diffiusion approximation for bulk queues. Management Science 27:1188- 1199.
5. Conners, D., G. Feigin, and D. Yao. 1994. Scheduling semiconductor lines using a fluid model. IEEE Transactions on Robotics and Automation l0 (2): 88-98.
6. Conners, D., G. Feigin, and D. Yao. 1996. A queueing network model for semiconductor manufacturing. IEEE Transactions on Semiconductor Manufacturing 9 (3): 412-427.
7. Gaver, P. 1962. A waiting line with interrupted service, including priorities. J.Roy.Stat.Soc.Ser.B 24:73-90.
8. Gelenbe, E., and G. Pujolle. 1987. Introduction to queueing networks. New York: John Wiley & Sons.
9. ×/G(b,b)/c queue. Operations Research Letters 34:205-213.
10. Hanschke, T., and H. Zisgen. 2005. Queueing networks with batch service. IBM Internal Technical Report.
11. Kramer, M., and I. Meents. 2001. Integrated simulation - optimization strategies and logistical process control for production planning based on collaboratively maintained queueing models. Ph.D. thesis, Clausthal University of Technology, Clausthal-Zellerfeld, Germany.
12. Little, J. 1961. A proof for the queueing formulae L = λW. Operations Research 9:383-387.
13. Meents, I., and H. Zisgen. 2004. Simulation of production processes by means of continuous fluid models. IBM Internal Technical Report.
14. Pujolle, G., and W. Ai, 1986. A solution for multiserver and multiclass open queueing networks. INFOR 24:221-230.
15. Shanthikumar, J., S. Ding, and M. Zhang. 2007. Queueing theory for semiconductor manufacturing systems: A survey and open problems. IEEE Transactions on Automation Science and Engineering 4 (4): 513-532.
16. Zisgen, H. 1999. Warteschlangennetzwerke mit Gruppenbedienung. Ph.D. thesis, Clausthal University of Technology, Clausthal-Zellerfeld, Germany.