Skip to main content
Springer Nature Link
Log in

Queues with group arrivals and exhaustive service discipline

  • Contributed Papers
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

Queues with compound Poisson arrivals, phase-type service and exhaustive service discipline are studied. An algorithmic method is developed to compute the steady-state probability distribution of the number of customers in the system with unlimited or limited queue capacities. Examples with different model parameters are given to show the computational efficiency of the method. In the Appendix, the stochastic decomposition property for the queues with single arrivals and with exhaustive service discipline is extended to queues with group arrivals.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Chaudhry, M.L. and J.G.C. Templeton (1983):A First Course in Bulk Queues, John Wiley, New York.

    Google Scholar 

  2. Doshi, B. (1986): A Note on the Stochastic Decomposition in a GI/G/1 Queue with Vacations or Set-Up Times, to appear in J. Applied Probability.

  3. Fuhrmann, S.W. (1984): A Note on the M/G/1 Queue with Server Vacations, Opns. Res., 32, 1368–1373.

    Google Scholar 

  4. Fuhrmann, S.W. and R. Cooper (1985): Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations, Opns. Res., 33, 1117–1129.

    Google Scholar 

  5. Heyman, D.P. (1968): Optimal Operating Policies for M/G/1 Queueing Systems, Opns. Res., 16, 362–382.

    Google Scholar 

  6. Heyman, D.P. and M. Sobel (1982):Stochastic Models in Operations Research, Vol. I, McGraw-Hill, New York.

    Google Scholar 

  7. Keilson, J. and L.D. Servi (1985): Blocking Probability in M/G/1 Vacation Systems with Occupancy Level Dependent Schedules, to appear in Opns. Res.

  8. Lee, T. (1984): M/G/1/N Queue with Vacation and Exhaustive Service Discipline, Opns. Res., 32, 774–785.

    Google Scholar 

  9. Ross, S.M. (1980):Introduction to Probability Models, Academic Press, New York.

    Google Scholar 

  10. Stidham, S. (1972): Regenerative Processes in the Theory of Queues, with Applications to the Alternating Priority Queue, J. Applied Probability, 4, 542–577.

    Google Scholar 

  11. Yadin, M. and P. Naor (1963): Queueing Systems with a Removable Service Station, Opns. Res. Quart., 14, 393–405.

    Google Scholar 

  12. Wolf, R.W. (1982): Poisson Arrivals see Time Averages, Opns. Res., 39, 223–231.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial Engineering Department, Rutgers University, P. O. Box 909, 08855-0909, Piscataway, New Jersey, USA

    Tayfur Altiok

Authors
  1. Tayfur Altiok
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Altiok, T. Queues with group arrivals and exhaustive service discipline. Queueing Syst 2, 307–320 (1987). https://doi.org/10.1007/BF01150043

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01150043

Keywords