Performance analysis of closed-loop assembly lines with general processing times and finite buffer spaces

IIE Transactions (Institute of Industrial Engineers)

Volumn 45, Issue 5, 2013, Pages 502-515

  Lagershausen, Svenja ^a   Manitz, Michael ^a   Tempelmeier, Horst ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

blocking after service; closed queueing networks; Closed loop assembly lines; decomposition approach; finite buffers; general processing times

Indexed keywords

ASSEMBLY; ASSEMBLY MACHINES; QUEUEING THEORY;

AFTER-SERVICE; ASSEMBLY LINE; CLOSED QUEUEING NETWORK; DECOMPOSITION APPROACH; FINITE BUFFER; PROCESSING TIME;

QUEUEING NETWORKS;

EID: 84873676187     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/0740817X.2012.705450     Document Type: Article

References (20)

1. Akyildiz, I. F. 1987. " General closed queueing networks with blocking ". In Proceedings of PERFORMANCE 87 283-303.
2. Bolch, G., Greiner, S., de Meer, H., and, Trivedi, K. S. 2006. Queueing Networks and Markov Chains. Modeling and Performance Evaluation with Computer Science Applications, second edition, Hoboken, NJ: John Wiley & Sons.
3. Bouhchouch, A., Frein, Y., and, Dallery, Y. 1993. Analysis of closed-loop manufacturing systems with finite buffers. Applied Stochastic Models and Data Analysis, 9 (2): 111-125.
4. Bouhchouch, A., Frein, Y., and, Dallery, Y. 1996. Performance evaluation of closed tandem queueing networks with finite buffers. Performance Evaluation, 26 (2): 115-132. (Pubitemid 126401301)
5. Buzacott, J. A., Liu, X.-G., and, Shanthikumar, J. G. 1995. Multistage flow line analysis using the stopped arrival queueing model. IIE Transactions, 27 (4): 444-455.
6. Buzacott, J. A., and, Shanthikumar, J. G. 1993. Stochastic Models of Manufacturing Systems, Englewood Cliffs, NJ: Prentice Hall.
7. Duenyas, I. 1994. Estimating the throughput of a cyclic assembly system. International Journal of Production Research, 32 (6): 1403-1419.
8. Gershwin, S. B., and, Burman, M. H. 2000. A decomposition method for analyzing inhomogeneous assembly/disassembly systems. Annals of Operations Research, 93 (1-4): 91-115.
9. Helber, S., Schimmelpfeng, K., and, Stolletz, R. 2011. Setting inventory levels of CONWIP flow lines via linear programming. BuR-Business Research, 4 (1): 98-115.
10. Inman, R. R. 1999. Empirical evaluation of exponential and independence assumptions in queueing models of manufacturing systems. Production and Operations Management, 8 (4): 409-432.
11. Li, J., Blumenfeld, D. E., Huang, N., and, Alden, J. M. 2009. Throughput analysis of production systems: recent advances and future topics. International Journal of Production Research, 47 (14): 3823-3851.
12. Manitz, M. 2008. Queueing-model based analysis of assembly lines with finite buffers and general service times. Computers & Operations Research, 35 (8): 2520-2536. (Pubitemid 350235133)
13. Manitz, M. 2010, June. Analysis of assembly/disassembly queueing networks with blocking and general service times. Technical report, University of Cologne, Cologne, Germany.
14. Marie, R. A. 1979. An approximate analytical method for general queueing networks. IEEE Transactions on Software Engineering, 5 (5): 530-538.
15. Onvural, R. 1990. Survey of closed queueing networks with blocking. ACM Computing Surveys, 22 (2): 83-121. (Pubitemid 20708311)
16. Tempelmeier, H. 2003. Practical considerations in the optimization of flow production systems. International Journal of Production Research, 41 (1): 149-170.
17. Tempelmeier, H., and, Bǔrger, M. 2001. Performance evaluation of unbalanced flow lines with general distributed processing times, failures and imperfect production. IIE Transactions, 33 (4): 293-302. (Pubitemid 32272433)
18. Tempelmeier, H., and, Kuhn, H. 1993. Flexible Manufacturing Systems. Decision Support for Design and Operation, Hoboken, NJ: John Wiley & Sons.
19. Tolio, T., and, Gershwin, S. 1998. Throughput estimation in cyclic queueing networks with blocking. Annals of Operations Research, 79: 207-229. (Pubitemid 128404045)
20. Yuzukirmizi, M. 2005. Finite closed queueing networks with multiple servers and multiple chains. Ph.D. thesis, University of Massachusetts Amherst, MA