A Simple Method for Reducing Queuing Times in M/G/1

D. E. Matthews
Additional contact information
D. E. Matthews: University of Waterloo, Waterloo, Ontario

Operations Research, 1979, vol. 27, issue 2, 318-323

Abstract: In many queuing situations customers are served in order of arrival; yet if customers with shorter service times were served first, it is well known that the mean queuing time could be reduced considerably. In a comparison with the “optimal” shortest service-time rule, a simple queue discipline involving only two non-preemptive priority classes fares very well. Numerical results illustrate the practical effects of implementing this simple alternative to service in order of arrival in a variety of queuing situations.

Date: 1979
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.2.318 (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:27:y:1979:i:2:p:318-323

Access Statistics for this article

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