Abstract
We establish tight bounds on the benefit of preemption with respect to the ℓp norm minimization objective for identical machines and for two uniformly related machines (based on their speed ratio). This benefit of preemption is the supremum ratio between the optimal costs of non-preemptive and preemptive schedules.
Original language | English |
---|---|
Pages (from-to) | 462-468 |
Number of pages | 7 |
Journal | Operations Research Letters |
Volume | 46 |
Issue number | 4 |
DOIs | |
State | Published - Jul 2018 |
Bibliographical note
Publisher Copyright:© 2018 Elsevier B.V.
Keywords
- Benefit of preemption
- Load balancing
- Scheduling
ASJC Scopus subject areas
- Software
- Management Science and Operations Research
- Industrial and Manufacturing Engineering
- Applied Mathematics