Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
A review of L=&lgr;W and extensions
Queueing Systems: Theory and Applications
Lean Six SIGMA: Combining Six SIGMA Quality with Lean Speed
Lean Six SIGMA: Combining Six SIGMA Quality with Lean Speed
Analysis, Design, and Control of Queueing Systems
Operations Research
Analyzing Computer System Performance with Perl: PDQ
Analyzing Computer System Performance with Perl: PDQ
Introduction to “Little's Law as Viewed on Its 50th Anniversary”
Operations Research
From the Editor: Reflections on the Last Six Years
Operations Research
An MVA approximation for conwip priority modeling
Proceedings of the Winter Simulation Conference
Little's law when the average waiting time is infinite
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
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.