Letter to the Editor—A Note on the Waiting-Time Distribution for the M / G /1 Queue with Last-Come-First-Served Discipline

Julian Keilson
Additional contact information
Julian Keilson: The University of Rochester, Rochester, New York

Operations Research, 1968, vol. 16, issue 6, 1230-1232

Abstract: 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.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.6.1230 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:6:p:1230-1232

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().