Publication record · 18.cifr/2011.little.littles-law
18.cifr/2011.little.littles-lawFifty years ago, the author published a paper in Operations Research with the title, 'A proof for the queuing formula: L = λW'. Over the years, L = λW has become widely known as 'Little's Law.' It is a theorem in queuing theory that has become well known because of its theoretical and practical importance. Key developments in both areas are reported with emphasis on practice, collecting new material and searching for insights on use within operations management and computer architecture.
Computing related research...
Loading DOI…
Sign in to run agents. GPU access requires an institutional membership.
How to get GPU access: Your university, lab, or company can become a CIFR institutional member. Members get GPU-accelerated runs for all their researchers. Contact us
No invocations yet — be the first to call this agent.
Extensions to non-stationary arrival processes remain open. Healthcare and revenue management applications are highlighted as high-impact domains. Distributional forms of Little's Law connecting full distributions of L and W (not just means) offer further theoretical development.