A Priority Rule Based on the Ranking of the Service Times for the M / G /1 Queue

S. Sreekantan Nair and Marcel F. Neuts
Additional contact information
S. Sreekantan Nair: Purdue University, Lafayette, Indiana
Marcel F. Neuts: Purdue University, Lafayette, Indiana

Operations Research, 1969, vol. 17, issue 3, 466-477

Abstract: This paper studies the virtual waiting time for the M / G /1 queue under this priority rule: within each generation, customers are served in the order of shortest (or longest) service times. It also considers the limiting behavior of the virtual waiting time, and compares the asymptotic means with those of the first-come, first-served discipline.

Date: 1969
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.17.3.466 (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:17:y:1969:i:3:p:466-477

Access Statistics for this article

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