Analysis of manufacturing systems via single-class, semi-open queuing networks

International Journal of Production Research

Volumn 49, Issue 2, 2011, Pages 295-319

  Heragu, Sunderesh S ^a   Srinivasan, Mukund ^b  

^a University of Louisville   (United States)

^b UNIVERSITY OF MINNESOTA   (United States)

Author keywords

heuristics; performance measures; semi open queuing network

Indexed keywords

CLOSED QUEUING NETWORK; HEURISTICS; MANUFACTURING SYSTEM; MULTIPLE SERVERS; PERFORMANCE MEASURE; QUEUING NETWORK; REALISTIC MODEL; SERVICE TIME DISTRIBUTION;

MANUFACTURE; QUEUEING NETWORKS;

QUEUEING THEORY;

EID: 78649463177     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540903527378     Document Type: Article

References (19)

1. Avi-Itzhak, B. and Heyman, D. P., 1973. Approximate queuing models for multiprogramming computer systems. Operations Research, 21(6), 1212-1230.
2. Baynat, B. and Dallery, Y., 1993. Approximate techniques for general closed queueing networks with subnetworks having population constraints. European Journal of Operational Research, 69(3), 250-264.
3. Buitenhek, R., 1998. Performance evaluation of dual resource manufacturing systems. Thesis (PhD). Universitiet Twente, Netherlands.
4. Buitenhek, R., van Houtum, G.-J., and Zijm, W. H. M., 2000. AMVA-based solution procedures for open queuing network with population constraints. Annals of Operations Research, 93 (1-4), 15-40.
5. Buzacott, J. A. and Shanthikumar, J. G., 1980. Models for understanding flexible manufacturing systems. AIIE Transactions, 12(4), 339-350.
6. Buzacott, J. A. and Shanthikumar, J. G., 1993. Stochastic models of manufacturing systems. Englewood Cliffs, NJ: Prentice Hall.
7. Dallery, Y., 1990. Approximate analysis of general OQNs with restricted capacity. Performance Evaluation, 11(3), 209-222.
8. Granger, J., Krishnamurthy, A., and Robinson, S. M., 2006. Rapid improvement of stochastic networks using two-moment approximations. Mathematical and Computer Modeling, 43 (9-10), 1038-1060.
9. Hiller, F. S. and Lieberman, G. J., 2005. Introduction to operations research. New York, NY: McGraw-Hill.
10. Jia, J. and Heragu, S. S., 2009. Solving semi-open queuing networks. Operations Research, 57(2), 391-401.
11. Kogan, Y. A. and Puhalskii, A. A., 1984. On tandem queues with blocking in heavy traffic. In: E. Gelenbe, ed. Performance' 84. Paris: Elsevier Science Publishers, B. V. (North-Holland), 549-558.
12. Konheim, A. G. and Reiser, M., 1978. A queuing model with finite waiting room and blocking. SIAM Journal of Computing, 7(2), 210-219.
13. Krishnamurthy, A. and Suri, R., 2006. Performance analysis of single stage Kanban controlled production systems using parametric decomposition. Queuing Systems, 54(2), 141-162.
14. Krishnamurthy, A., Suri, R., and Vernon, M. K., 2000. A new approach for analyzing queuing models of material control strategies in manufacturing systems. Proceedings of the 4th International Workshop on Queuing Networks with Finite Capacity (QNETs2000), West Yorkshire, UK, 26/1-26/15.
15. Little, J. D. C., 1961. A proof for the queuing formula: L = λW. Operations Research, 9(3), 383-387.
16. Massey, W. A. and Srinivasan, R., 1991. A heavy traffic analysis for semi-open networks. Performance Evaluation, 13(1), 59-66.
17. Marie, R., 1979. An approximate method for general queuing networks. IEEE Transactions on Software Engineering, 5(5), 530-538.
18. Shanthikumar, J. G. and Buzacott, J. A., 1980. On the approximations to the single server queue. International Journal of Production Research, 18(9), 761-773.
19. Whitt, W., 1983. The queuing network analyzer. Bell Systems Technical Journal, 62, 2779-2813.