| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 7543807 | Operations Research Letters | 2018 | 7 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Leah Epstein, Asaf Levin,