On the waiting time of a two-stage queueing system with blocking
- 1 September 1984
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 21 (3) , 628-638
- https://doi.org/10.2307/3213623
Abstract
An analysis is given of the first-come-first-served waiting-time process in stages 1 and 2 of a two-stage service system with k and n parallel service channels in the first and second stages respectively, and m intermediate waiting places (k, n ≧ 1, m ≧ 0).Although the method of analysis is straightforward the details are intricate and require careful study of the location of the zeros of a high-degree polynomial.The analysis paves the way for an extensive study of the numerical effect on waiting time of blocking in commonly encountered systems of this nature. ‘Effective service time' in stage 1, defined so as to include blocked time, is considered separately.Keywords
This publication has 6 references indexed in Scilit:
- Efficient Algorithmic Solutions to Exponential Tandem Queues with BlockingSIAM Journal on Algebraic Discrete Methods, 1980
- A Queueing Model with Finite Waiting Room and BlockingJournal of the ACM, 1976
- Two-Stage Production Systems with Intermediate StorageA I I E Transactions, 1975
- On the mean production rate of a two-stage production system of the tandem typeInternational Journal of Production Research, 1975
- Two queues in series with a finite, intermediate waitingroomJournal of Applied Probability, 1968
- A Sequence of Two Servers with No Intermediate QueueManagement Science, 1965