A Simple Proof of: L = λW

Published Online:https://doi.org/10.1287/opre.15.6.1109

A simple proof of the fundamental queuing formula L = λW is given that is based on renewal theory. The basic assumptions that are needed are: (1) the event system is empty is recurrent, and (2) the arrival and waiting-time mechanisms are reset by the next arrival after this event occurs.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.