Performance analysis of multi-server tandem queues with finite buffers and blocking

  • Marcel van Vuuren
  • Ivo J.B.F. Adan
  • Simone A.E. Resing-Sassen


In this paper we study multi-server tandem queues with finite buffers and blocking after service. The service times are generally distributed. We develop an efficient approximation method to determine performance characteristics such as the throughput and mean sojourn times. The method is based on decomposition into two-station subsystems, the parameters of which are determined by iteration. For the analysis of the subsystems we developed a spectral expansion method. Comparison with simulation shows that the approximation method produces accurate results. So it is useful for the design and analysis of production lines.


Approximation Blocking Decomposition Finite buffers Multiserver tandem queues Production lines Spectral expansion 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bertsimas D (1990) An analytic approach to a general class of G/G/s queueing systems. Operations Rearch earch 1: 139–155zbMATHMathSciNetGoogle Scholar
  2. 2.
    Buzacott JA (1967) Automatic transfer lines with buffer stock. International Journal of Production Research 5: 183–200Google Scholar
  3. 3.
    Cruz FRB, MacGregor Smith J (2004) Algorithm for analysis of generalized M/G/C/C state dependent queueing networks. Scholar
  4. 4.
    Cruz FRB, MacGregor Smith J, Queiroz DC (2004) Service and capacity allocation in M/G/C/C state dependent queueing networks. Computers & Operations Research (to appear)Google Scholar
  5. 5.
    Dallery Y, David R, Xie X (1989) Approximate analysis of transfer lines with unreliable machines and finite buffers. IEEE Transactiona on Automatic Control 34(9): 943–953Google Scholar
  6. 6.
    Dallery Y, Gershwin B (1992) Manufacturing flow line systems: a review of models and analytical results. Queueing Systems 12: 3–94CrossRefGoogle Scholar
  7. 7.
    Gershwin SB, Burman MH (2000) A decomposition method for analyzing inhomogeneous assembly/disassembly systems. Annals of Operation Research 93: 91–115MathSciNetGoogle Scholar
  8. 8.
    Hillier FS, So KC (1995) On the optimal design of tandem queueing systems with finite buffers. Queueing Systems Theory Application 21: 245–266MathSciNetGoogle Scholar
  9. 9.
    Jain S, MacGregor Smith J (1994) Open finite queueing networks with M/M/C/K parallel servers. Computers Operations Research 21(3): 297–317Google Scholar
  10. 10.
    Johnson MA (1993) An empirical study of queueing approximations based on phasetype distributions. Communication Statistic-Stochastic Models 9(4): 531–561zbMATHGoogle Scholar
  11. 11.
    Kerbache L, MacGregor Smith J (1987) The generalized expansion method for open finite queueing networks. The European Journal of Operations Research 32: 448–461Google Scholar
  12. 12.
    Kouvatsos D, Xenios NP (1989) MEM for arbitrary queueing networks with multiple general servers and repetative-service blocking. Performance Evaluation 10: 169–195MathSciNetCrossRefGoogle Scholar
  13. 13.
    Li Y, Cai X, Tu F, Shao X (2004) Optimization of tandem queue systems with finite buffers. Computers & Operations Research 31: 963–984MathSciNetGoogle Scholar
  14. 14.
    Marie RA (1980) Calculating equilibrium probabilities for λ(n)/Ck/1/N queue. Proceedings Performance’ 80, Toronto, pp 117–125Google Scholar
  15. 15.
    Mickens R (1987) Difference equations. Van Nostrand-Reinhold, New YorkGoogle Scholar
  16. 16.
    Mitrani I, Mitra D (1992) A spectral expansion method for random walks on semiinfinite strips. In: Beauwens R, de Groen P (eds) Iterative methods in linear algebra, pp 141–149. North-Holland, AmsterdamGoogle Scholar
  17. 17.
    Perros HG (1989) A bibliography of papers on queueing networks with finite capacity queues. Perf Eval 10: 255–260MathSciNetCrossRefGoogle Scholar
  18. 18.
    Perros HG (1994) Queueing networks with blocking. Oxford University Press, OxfordGoogle Scholar
  19. 19.
    Perros HG, Altiok T (1989) Queueing networks with blocking. North-Holland, AmsterdamGoogle Scholar
  20. 20.
    MacGregor Smith J, Cruz FRB (2000) The buffer allocation problem for general finite buffer queueing networks. Scholar
  21. 21.
    Tahilramani H, Manjunath D, Bose SK (1999) Approximate analysis of open network of GE/GE/m/N queues with transfer blocking. MASCOTS’99, pp 164–172Google Scholar
  22. 22.
    Tijms HC (1994) Stochastic models: an algorithmic approach. Wiley, ChichesterGoogle Scholar
  23. 23.
    Tolio T, Matta A, Gershwin SB (2002) Analysis of two-machine lines with multiple failure modes. IIE Transactions 34: 51–62CrossRefGoogle Scholar
  24. 24.
    van Vuuren M (2003) Performance analysis of multi-server tandem queues with finite buffers. Master’s Thesis, University of Technology Eindhoven, The NetherlandsGoogle Scholar
  25. 25. Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Marcel van Vuuren
    • 1
  • Ivo J.B.F. Adan
    • 1
  • Simone A.E. Resing-Sassen
    • 2
  1. 1.Eindhoven University of TechnologyEindhovenThe Netherlands
  2. 2.CQM BVEindhovenThe Netherlands

Personalised recommendations