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

PDF
Restricted to UT campus only: Request a copy
222Kb

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
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/63171
Official URL:	http://dx.doi.org/10.1016/S0167-6377(02)00220-1
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page

Metis ID: 213406