Minimizing Delays in the GI / G /1 Queue

Ward Whitt
Additional contact information
Ward Whitt: AT&T Bell Laboratories, Holmdel, New Jersey

Operations Research, 1984, vol. 32, issue 1, 41-51

Abstract: What service-time distribution minimizes delays in a GI / G /1 queue with given renewal arrival process and given mean service time? It is natural to conjecture that the deterministic service-time distribution with unit mass on the mean is optimal for all objective functions of the form Ef ( W ) where f is a nondecreasing function of the steady-state delay W . However, we show that this conjecture is false. In fact, for hyperexponential interarrival-time distributions (mixtures of two exponential distributions), the service-time distribution minimizing the average delay maximizes the proportion of customers delayed.

Keywords: 696; minimizing; delays (search for similar items in EconPapers)
Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.32.1.41 (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:32:y:1984:i:1:p:41-51

Access Statistics for this article

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