Bounding the performance of tandem queues with finite buffer spaces
From MaRDI portal
Publication:1315341
DOI10.1007/BF02024664zbMath0787.60118OpenAlexW2019481586MaRDI QIDQ1315341
Mohsen A. Jafari, J. George Shanthikumar
Publication date: 7 April 1994
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02024664
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items
PERFORMANCE MEASURES FOR THE TWO-NODE QUEUE WITH FINITE BUFFERS, Server assignment for multi-stage production systems with finite buffers, Manufacturing flow line systems: A review of models and analytical results, Performance bounds on multiserver exponential tandem queues with finite buffers, New bounds for expected cycle times in tandem queues with blocking
Cites Work
- The preservation of likelihood ratio ordering under convolution
- Approximate analysis of exponential queueing systems with blocking
- Approximate analysis of exponential tandem queues with blocking
- Markov chain models - rarity and exponentiality
- On equivalencies of blocking mechanisms in queueing networks with blocking
- Simple Bounds for Finite Single-Server Exponential Tandem Queues
