If you need an accessible version of this item please contact JSTOR User Support

On Queueing Processes with Bulk Service

Norman T. J. Bailey
Journal of the Royal Statistical Society. Series B (Methodological)
Vol. 16, No. 1 (1954), pp. 80-87
Published by: Wiley for the Royal Statistical Society
Stable URL: http://www.jstor.org/stable/2984011
Page Count: 8
  • Download PDF
  • Cite this Item

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support
On Queueing Processes with Bulk Service
Preview not available

Abstract

A mathematical investigation has been made of a simple queueing process in which customers arrive at random, form a single queue in order of arrival, and are served in batches, the size of each batch having a fixed maximum. In most of the results obtained the time intervals between successive occasions of service are assumed to be independently distributed in χ2 distributions with an even number of degrees of freedom (including the special cases of a random distribution and a constant service interval). The equilibrium distribution of queue length has been studied by the imbedded Markov chain method, and ergodicity established when the average demand is less than the average supply available. Expressions for the mean and variance of queue length, and the mean waiting-time are given. A useful inequality for the latter is also available in the special case of a constant service interval. An immediate application can be made to hospital out-patient departments, with possible extensions to lifts, buses and so on.

Page Thumbnails

  • Thumbnail: Page 
80
    80
  • Thumbnail: Page 
81
    81
  • Thumbnail: Page 
82
    82
  • Thumbnail: Page 
83
    83
  • Thumbnail: Page 
84
    84
  • Thumbnail: Page 
85
    85
  • Thumbnail: Page 
86
    86
  • Thumbnail: Page 
87
    87