| Article ID: | iaor20022033 |
| Country: | United States |
| Volume: | 49 |
| Issue: | 1 |
| Start Page Number: | 145 |
| End Page Number: | 156 |
| Publication Date: | Jan 2001 |
| Journal: | Operations Research |
| Authors: | Drekic Steve, Stanford David A.. |
| Keywords: | stochastic processes |
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.