A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity
From MaRDI portal
Publication:911173
DOI10.1016/0305-0548(90)90052-9zbMath0697.60096OpenAlexW2068538898MaRDI QIDQ911173
Hussein Badr, George D. Tsiotras
Publication date: 1990
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(90)90052-9
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (3)
Closed-form expected queueing times of a tandem system with finite intermediate buffer: A recursive approach ⋮ Control of a tandem queue with a startup cost for the second server ⋮ Exact analysis of the joint production quantity-quality of two-station stable tandem manufacturing system with restricted capacity
Cites Work
- Asymptotic behavior of the expansion method for open finite queueing networks
- On the blocking process in queue networks
- A Comparison Between Tandem Queues with Dependent and Independent Service Times
- Efficient Algorithmic Solutions to Exponential Tandem Queues with Blocking
- A Queueing Model with Finite Waiting Room and Blocking
This page was built for publication: A recursive methodology for the derivation of the blocking probabilities of tandem queues with finite graph capacity
