Reducing Delay in Preemptive Repeat Priority Queues

Steve Drekic and David A. Stanford ()
Additional contact information
Steve Drekic: Department of Statistic and Actuarial Sciences, University of Waterloo, Ontario N2L 3G1 Canada
David A. Stanford: Department of Statistical and Actuarial Sciences, The University of Western Ontario, London, Ontario N6A 5B7, Canada

Operations Research, 2001, vol. 49, issue 1, 145-156

Abstract: The classical model of the preemptive repeat priority queue assumes that there is a single distribution from which service times for a given class are selected, regardless of the number of preemptions. This paper presents three alternatives for improving service progressively to preempted customers: (1) changing the service distribution, (2) preventing further preemptions, and (3) promoting customers to the next higher priority class. The Laplace-Stieltjes transform of the flow time distribution is found for each class in a model that can employ these three alternatives in arbitrary combinations.

Keywords: Queues; priority: flow times in preemptive-repeat different queues with three methods to reduce customer delay (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.49.1.145.11186 (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:49:y:2001:i:1:p:145-156

Access Statistics for this article

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