The queue gi/m/2 with service rate depending on the number of busy servers

  • U. N. Bhat


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.


Service Time Busy Period Western AUSTRALIA Time Dependent Behaviour Time Dependent Solution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [ 1.
    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.MATHMathSciNetGoogle Scholar
  2. [ 2.
    S. Karlin and J. McGregor, “Many server queueing processes with Poisson input and exponential service times,“Pacific J. Math., 8 (1958), 327–334.MathSciNetGoogle Scholar
  3. [ 3]
    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.MATHCrossRefMathSciNetGoogle Scholar
  4. [ 4.
    T. L. Saaty, “Time dependent solution of many server Poisson queue,”perations Research, 8 (1960), 755–772.MATHMathSciNetGoogle Scholar
  5. [ 5.
    L. Takács, “Transient behaviour of single server queueing processes with recurrent input and exponentially distributed service times,”Operations Research, 8 (1960), 231–245.MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Institute of Statistical Mathematics 1966

Authors and Affiliations

  • U. N. Bhat
    • 1
  1. 1.Tiie University of Western AustraliaAustralia

Personalised recommendations