A semi-preemptive priority scheduling discipline: Performance analysis
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Ndreca, Sokol & Scoppola, Benedetto, 2008. "Discrete time GI/Geom/1 queueing system with priority," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1403-1408, September.
- Walraevens, Joris & Steyaert, Bart & Bruneel, Herwig, 2008. "Analysis of a discrete-time preemptive resume priority buffer," European Journal of Operational Research, Elsevier, vol. 186(1), pages 182-201, April.
- Zeephongsekul, P. & Bedford, A., 2006. "Waiting time analysis of the multiple priority dual queue with a preemptive priority service discipline," European Journal of Operational Research, Elsevier, vol. 172(3), pages 886-908, August.
- Kim, Kilhwan & Chae, Kyung C., 2010. "Discrete-time queues with discretionary priorities," European Journal of Operational Research, Elsevier, vol. 200(2), pages 473-485, January.
- Feng, Wei & Umemura, Masataka, 2009. "Analysis of a finite buffer model with two servers and two nonpreemptive priority classes," European Journal of Operational Research, Elsevier, vol. 192(1), pages 151-172, January.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:224:y:2013:i:2:p:324-332. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.