A Simple Proof of: L = λ W

William S. Jewell
Additional contact information
William S. Jewell: University of California, Berkeley, California

Operations Research, 1967, vol. 15, issue 6, 1109-1116

Abstract: A simple proof of the fundamental queuing formula L = λ W is given that is based on renewal theory. The basic assumptions that are needed are: (1) the event system is empty is recurrent, and (2) the arrival and waiting-time mechanisms are reset by the next arrival after this event occurs.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.6.1109 (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:15:y:1967:i:6:p:1109-1116

Access Statistics for this article

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