Approximate analysis of single-server tandem queues with finite buffers

DOI10.1007/S10479-011-1021-1zbMath1275.90017OpenAlexW2174859038MaRDI QIDQ383145

Marcel Van Vuuren, Remco Bierbooms, Ivo J. B. F. Adan

Publication date: 25 November 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-1021-1

zbMATH Keywords

decompositionfinite bufferMarkovian arrival processmatrix-analytic methodsblockingflow line

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items (2)

Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The generalized expansion method for open finite queueing networks
• Manufacturing flow line systems: A review of models and analytical results
• Bifurcation and chaos in drillstring dynamics
• Performance evaluation of transfer lines with general repair times and multiple failure modes
• Performance analysis of multi-server tandem queues with finite buffers and blocking
• Analysis of flow lines with Cox-2-distributed processing times and limited buffer capacity
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• An empirical study of queueing approximations based on phase-type distributions
• Computer Performance Evaluation. Modelling Techniques and Tools

This page was built for publication: Approximate analysis of single-server tandem queues with finite buffers