.png){kind=icon}
.png){kind=icon}
Return
A semi-preemptive priority scheduling discipline: Performance analysis
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2012.08.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we present an in-depth analytical study of a semi-preemptive priority scheduling discipline. This discipline eliminates the deficits of both the full- and non-preemptive versions. Under the non-preemptive category, in particular, higher-priority customers may have to wait even when the service of a lower-priority customer has just started, while under the full-preemptive discipline, the almost completed service of a lower-priority customer may be interrupted due to the arrival of higher-priority customers, possibly causing a large extra delay. For fixed low-priority service times, the semi-preemptive priority scheduling discipline shows a performance gain of up to 6% compared to the full- and non-preemptive versions. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Priority scheduling
(Non-)preemptive
Performance analysis
Cost function
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W