Technical Note—A Last Word on L = λ W

Shaler Stidham
Additional contact information
Shaler Stidham: Cornell University, Ithaca, New York

Operations Research, 1974, vol. 22, issue 2, 417-421

Abstract: This note gives a rigorous proof of the queuing formula L = λ W , using as hypotheses only that the limiting averages, λ and W , exist and are finite. The proof is related to one given in a previous paper by the author that used a discounted analogue and Tauberian theorems. The proof in the present paper, however, is direct and avoids the use of transforms. Some comments are offered on the relation between the proof and the heuristic arguments for L = λ W commonly encountered in the literature.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.22.2.417 (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:22:y:1974:i:2:p:417-421

Access Statistics for this article

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