Skip to main content
Log in

Further results for the M/M(a, ∞)/N batch-service system

  • Invited Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

A multi-server Markovian queueing system is considered such that an idle server will take the entire batch of waiting customers into service as soon as their number is as large as some control limit. Some new results are derived. These include the distribution of the time interval between two consecutive commencements of service (including itsrth moment) and the actual service batch size distribution. In addition, the average customer waiting time in the queue is derived by a simple combinatorial approach.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. M. Abramowitz and I.A. Stegun (eds.),Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables (Dover, New York, 1972).

    Google Scholar 

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

    Google Scholar 

  3. G.P. Cosmetatos, Closed-form equilibrium results for theM/M a,∞/n queue, Europ. J. Oper. Res. 12 (1983) 203–204.

    Article  Google Scholar 

  4. R.K. Deb and R.F. Serfozo, Optimal control of batch service queues, Advan. Appl. Probab. 5 (1973) 340–361.

    Article  Google Scholar 

  5. P.M. Ghare, Multichannel queueing system with bulk service, Oper. Res. 16 (1968) 189–192.

    Article  Google Scholar 

  6. J. Medhi and A. Borthakur, On a two-server Markovian queue with a general bulk service rule, Cahiers du Centre d'Etudes de Recherche Opérationnelle 14 (1972) 151–158.

    Google Scholar 

  7. J. Medhi, Further results on waiting time distribution in a Poisson queue under a general bulk service rule, Cahiers du Centre d'Etudes de Recherche Opérationnelle 21 (1979) 183–189.

    Google Scholar 

  8. M.F. Neuts and R. Nadarajan, A multiserver queue with thresholds for the acceptance of customers in service, Oper. Res. 30 (1982) 948–960.

    Google Scholar 

  9. S.H. Sim and J.G.C. Templeton, Queue-dependent vehicle dispatching with options and optimal fleet size, Transportation Res. 16B (1982) 233–243.

    Article  Google Scholar 

  10. S.H. Sim and J.G.C. Templeton, Computational procedures for steady-state characteristics of unscheduled multicarrier shuttle system, Europ. J. Oper. Res. 12 (1983) 190–202.

    Article  Google Scholar 

  11. S.H. Sim and J.G.C. Templeton, Steady state results for theM/M(a, b)/c batch service system, Europ. J. Oper. Res. 21 (1985) 260–267.

    Article  Google Scholar 

  12. H.J. Weiss, The computation of optimal control limits for a queue with batch services, Management Sci. 25 (1979) 320–328.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This is an expanded version of “Combinatorial analysis of batch-service queues” which was presented at the ORSA/TIMS meeting, Orlando, Florida, November 1983.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sim, S.H., Templeton, J.G.C. Further results for the M/M(a, ∞)/N batch-service system. Queueing Syst 6, 277–286 (1990). https://doi.org/10.1007/BF02411478

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Navigation