Reducing delay in preemptive repeat priority queues
成果类型：
Article
署名作者：
Drekic, S; Stanford, DA
署名单位：
University of Waterloo; Western University (University of Western Ontario)
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.49.1.145.11186
发表日期：
2001
页码：
145-156
关键词：
摘要：
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.