The waiting-time distribution for an M/G/1 queue with last-come-first-served discipline has a simple structure that may be found from an argument based on the Takács server backlog process. This structure provides real-time information in a convenient form.
Julian Keilson, (1968) Letter to the Editor—A Note on the Waiting-Time Distribution for the M/G/1 Queue with Last-Come-First-Served Discipline. Operations Research 16(6):1230-1232.
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.