How useful are preemptive schedules?

Autor(en): Brucker, P
Heitmann, S
Hurink, J
Stichwörter: Operations Research & Management Science; parallel machine scheduling; preemption; TIME
Erscheinungsdatum: 2003
Herausgeber: ELSEVIER SCIENCE BV
Journal: OPERATIONS RESEARCH LETTERS
Volumen: 31
Ausgabe: 2
Startseite: 129
Seitenende: 136
Zusammenfassung: 
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. (C) 2002 Elsevier Science B.V. All rights reserved.
ISSN: 01676377
DOI: 10.1016/S0167-6377(02)00220-1

Show full item record

Page view(s)

1
Last Week
0
Last month
1
checked on Feb 21, 2024

Google ScholarTM

Check

Altmetric