Paper
The queueing system EkMa,b1 and its numerical analysis

https://doi.org/10.1016/0305-0548(82)90018-1Get rights and content

Abstract

In this paper steady-state random-point results for single-server bulk-service system kMa,b1 are related to imbedded Markov Chain results using the Erlangian technique. Steady-state results, including the expected number in queue at random and arrival epochs, and waiting time distribution are found in terms of the unique root of the characteristic equation. Examples of extensive numerical work are presented in tabular forms.

References (11)

  • A. Borthakur

    A Poisson queue with a general bulk service rule

    J. Assam Sci. Soc. XIV

    (1971)
  • M.L. Chaudhry

    Marriage between the supplementary variable technique and the imbedded Markov chain technique-I

  • M. L. Chaudhry and J. G. C. Templeton, a first course in bulk queues. To...
  • M.V. Cromie et al.

    Analytically explicit results for the queueing system M/Mx/C with charts and tables for certain measures of efficiency

    Opl. Res. Q.

    (1976)
  • W.C. Giffin

    Queueing—basic theory and applications

There are more references available in the full text version of this article.

Cited by (17)

View all citing articles on Scopus

Captain G. D. Easton received a B. Sc. in Mathematics and Physics in 1972 from the Royal Military College of Canada, where he is presently a Master's candidate. He will shortly join the Directorate of Operations Research and Analysis, National Defence Headquarters in Ottawa. His current research interests include the application of Operations Research Methods of Optimization of resource usage.

View full text