Hostname: page-component-cd9895bd7-dk4vv Total loading time: 0 Render date: 2025-01-03T21:00:24.375Z Has data issue: false hasContentIssue false
  • English
  • Français

On the relation between customer and time averages in queues

Published online by Cambridge University Press:  14 July 2016

Shelby L. Brumelle
Shelby L. Brumelle*
Affiliation:
University of British Columbia, Vancouver
Get access Rights & Permissions [Opens in a new window]

Extract

Little [8] gave conditions sufficient to obtain the formula L = λW, where L is the time average queue size, W is the expected wait in queue, and λ is the arrival rate of customers. This formula is applicable to a very general class of queuing models and is one of the most useful results in queuing theory.

Type
Research Papers
Information
Journal of Applied Probability , Volume 8 , Issue 3 , September 1971 , pp. 508 - 520
Copyright
Copyright © Applied Probability Trust 1971 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1] Brumelle, S. L. (1970) An application of H = ?G to moments of queue length and waiting times. Working Paper No. 59, University of British Columbia.Google Scholar
[2] Brumelle, S. L. (1970) Some inequalities for parallel server queues. Operat. Res. (To appear.) CrossRefGoogle Scholar
[3] Cramer, H. (1961) Mathematical Methods of Statistics. Princeton University Press.Google Scholar
[4] Doob, J. L. (1953) Stochastic Processes. Wiley, New York.Google Scholar
[5] Feller, W. (1966) An Introduction to Probability Theory and its Applications. Vol. II. Wiley, New York.Google Scholar
[6] Jewell, W. S. (1967) A simple proof of L= ?W. Operat. Res. 15, 1109–1116.CrossRefGoogle Scholar
[7] Kiefer, J. and Wolfowitz, J. (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1–18.CrossRefGoogle Scholar
[8] Little, J. D. C. (1961) A proof for the queuing formula: L= ?W. Operat Res. 9, 383–387.CrossRefGoogle Scholar
[9] Loeve, M. (1963) Probability Theory. Van Nostrand, Princeton.Google Scholar
[10] Loynes, R. M. (1962) The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 494–520.CrossRefGoogle Scholar
[11] Stidham, S. Jr. (1968) Static decision models for queuing systems with non-linear waiting costs. Technical Report No. 9, Stanford University.Google Scholar
[12] Wolff, R. W. (1968) Time sharing with priorities. ORC 68–13, University of California at Berkeley.Google Scholar
[13] Wolff, R. W. (1969) Work-conserving priorities. J. Appl. Prob. 7, 327–337.CrossRefGoogle Scholar