How useful are preemptive schedules?


Brucker, Peter and Heitmann, Silvia and Hurink, Johann (2003) How useful are preemptive schedules? Operations Research Letters, 31 (2). pp. 129-136. ISSN 0167-6377

[img] PDF
Restricted to UT campus only
: Request a copy
Abstract:Machine scheduling admits two options to process jobs. In a preemptive mode processing may be interrupted and resumed later even on a different machine. In a nonpreemptive mode interruptions are not allowed. Usually, the possibility to preempt jobs leads to better performance values. However, also examples exist where preemptions do not improve the performance. This paper gives an overview of existing and new results on this topic for single and parallel machine scheduling problems.
Item Type:Article
Copyright:© 2003 Elsevier
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:
Official URL:
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page

Metis ID: 213406