A Proof for the Queuing Formula: L = (lambda) W

John D. C. Little
Additional contact information
John D. C. Little: Case Institute of Technology, Cleveland, Ohio

Operations Research, 1961, vol. 9, issue 3, 383-387

Abstract: In a queuing process, let 1/(lambda) be the mean time between the arrivals of two consecutive units, L be the mean number of units in the system, and W be the mean time spent by a unit in the system. It is shown that, if the three means are finite and the corresponding stochastic processes strictly stationary, and, if the arrival process is metrically transitive with nonzero mean, then L = (lambda) W .

Date: 1961
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.9.3.383 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:9:y:1961:i:3:p:383-387

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().