An approximate analysis of open tandem queueing networks with blocking and general service times

DOI10.1016/0377-2217(90)90305-UzbMath0705.60088OpenAlexW2082695226MaRDI QIDQ918042

Kyung P. Jun, Harry G. Perros

Publication date: 1990

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(90)90305-u

zbMATH Keywords

approximation algorithmsimulation resultsblockingtandem queueing networksCoxian distributionssteady-state queue-length distribution

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items

An efficient two-phase approximation method for exponential tandem queueing systems with blocking, Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy, A tractable analytical model for large-scale congested protein synthesis networks, Closed-form formulae for moment, tail probability, and blocking probability of waiting time in a buffer-sharing deterministic system, Buffer allocation in flow-shop-type production systems with general arrival and service patterns, Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines, An analytic finite capacity queueing network model capturing the propagation of congestion and blocking, New bounds for expected cycle times in tandem queues with blocking, An Approximation Method for Blocking Probabilities in M/D/1/K₁→ ⋅/D/1/K₂Queues

Cites Work

• Unnamed Item
• Unnamed Item
• The generalized expansion method for open finite queueing networks
• Queueing models for a flexible machining station. II: The method of Coxian phases
• Approximate analysis of exponential tandem queues with blocking
• On equivalencies of blocking mechanisms in queueing networks with blocking
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• An Approximation Method for Tandem Queues with Blocking
• Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking
• An Approximation Method for Open Restricted Queueing Networks
• Poisson Arrivals See Time Averages
• Approximate Analysis of General Queuing Networks by Decomposition
• A computationally efficient approximation algorithm for feed-forward open queueing networks with blocking
• Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach