OR FORUM---Little's Law as Viewed on Its 50th Anniversary

John D. C. Little ()
Additional contact information
John D. C. Little: MIT Sloan School of Management, Cambridge, Massachusetts 02139

Operations Research, 2011, vol. 59, issue 3, 536-549

Abstract: Fifty years ago, the author published a paper in Operations Research with the title, “A proof for the queuing formula: L = (lambda)W ” [Little, J. D. C. 1961. A proof for the queuing formula: L = (lambda)W . Oper. Res. 9 (3) 383--387]. Over the years, L = (lambda)W has become widely known as “Little's Law.” Basically, it is a theorem in queuing theory. It has become well known because of its theoretical and practical importance. We report key developments in both areas with the emphasis on practice. In the latter, we collect new material and search for insights on the use of Little's Law within the fields of operations management and computer architecture.

Keywords: Little's Law; queuing theory; operations management; computer engineering; computer architecture; operations research (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1110.0940 (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:59:y:2011:i:3:p:536-549

Access Statistics for this article

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