Error bounds on a practical approximation for finite tandem queues

DOI10.1016/S0167-6377(97)00029-1zbMath0892.90084OpenAlexW2134136796WikidataQ126628477 ScholiaQ126628477MaRDI QIDQ1382810

Nico M. van Dijk, Masakiyo Miyazawa

Publication date: 18 May 1998

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00029-1

zbMATH Keywords

Markov chainstail probabilitiesmean queue lengthfinite first stationtwo-stage tandem queue

Mathematics Subject Classification ID

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

Related Items (2)

New bounds for expected cycle times in tandem queues with blocking ⋮ On product form tandem structures

Cites Work

• Unnamed Item
• Unnamed Item
• A simple technique in Markovian control with applications to resource allocation to resource allocation in communication networks
• Simple bounds and monotonicity results for finite multi-server exponential tandem queues
• Manufacturing flow line systems: A review of models and analytical results
• An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking
• An Error-Bound Theorem for Approximate Markov Chains
• Perturbation theory for Markov reward processes with applications to queueing systems
• An Approximation Method for Tandem Queues with Blocking
• Simple Bounds for Finite Single-Server Exponential Tandem Queues
• An Approximation Method for Open Restricted Queueing Networks
• On Decomposition Methods for Tandem Queueing Networks with Blocking

This page was built for publication: Error bounds on a practical approximation for finite tandem queues