Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Little's Law as Viewed on Its 50th Anniversary

John D. C. Little
Operations Research
Vol. 59, No. 3 (May • June • 2011), pp. 536-549
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/23013126
Page Count: 14
  • Get Access
  • Download ($30.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Preview not available
Preview not available

Abstract

Fifty years ago, the author published a paper in Operations Research with the title, ``A proof for the queuing formula: L = λW" [Little, J. D. C. 1961. A proof for the queuing formula: L = λW. Oper. Res. 9(3) 383—387]. Over the years, L = λ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.

Page Thumbnails

  • Thumbnail: Page 
536
    536
  • Thumbnail: Page 
537
    537
  • Thumbnail: Page 
538
    538
  • Thumbnail: Page 
539
    539
  • Thumbnail: Page 
540
    540
  • Thumbnail: Page 
541
    541
  • Thumbnail: Page 
542
    542
  • Thumbnail: Page 
543
    543
  • Thumbnail: Page 
544
    544
  • Thumbnail: Page 
545
    545
  • Thumbnail: Page 
546
    546
  • Thumbnail: Page 
547
    547
  • Thumbnail: Page 
548
    548
  • Thumbnail: Page 
549
    549