A semi-preemptive priority scheduling discipline: Performance analysis
AbstractIn 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.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal European Journal of Operational Research.
Volume (Year): 224 (2013)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/locate/eor
Priority scheduling; (Non-)preemptive; Performance analysis; Cost function;
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.
- 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.
- 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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.