Summary
The time dependent behaviour of the two server queueing system with recurrent input and negative exponential service times is studied here using certain recurrence relations for the underlying queuelength process. The service times have a varying mean depending on the number of busy servers.
Similar content being viewed by others
References
K. L. Arora, “Time dependent solution of the two server queue fed by general arrival and exponential service time distributions,”Operations Research, 10 (1962), 327–334.
S. Karlin and J. McGregor, “Many server queueing processes with Poisson input and exponential service times,“Pacific J. Math., 8 (1958), 327–334.
D. G. Kendall, “Stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chain,”Ann. Math. Statist., 24 (1953), 338–354.
T. L. Saaty, “Time dependent solution of many server Poisson queue,”perations Research, 8 (1960), 755–772.
L. Takács, “Transient behaviour of single server queueing processes with recurrent input and exponentially distributed service times,”Operations Research, 8 (1960), 231–245.
Author information
Authors and Affiliations
About this article
Cite this article
Bhat, U.N. The queue gi/m/2 with service rate depending on the number of busy servers. Ann Inst Stat Math 18, 211–221 (1966). https://doi.org/10.1007/BF02869531
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02869531