Power of Preemption on Uniform Parallel Machines

Authors Alan J. Soper, Vitaly A. Strusevich

Thumbnail PDF


  • Filesize: 346 kB
  • 11 pages

Document Identifiers

Author Details

Alan J. Soper
Vitaly A. Strusevich

Cite AsGet BibTex

Alan J. Soper and Vitaly A. Strusevich. Power of Preemption on Uniform Parallel Machines. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014). Leibniz International Proceedings in Informatics (LIPIcs), Volume 28, pp. 392-402, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)


For a scheduling problem on parallel machines, the power of preemption is defined as the ratio of the makespan of an optimal non-preemptive schedule over the makespan of an optimal preemptive schedule. For m uniform parallel machines, we give the necessary and sufficient conditions under which the global bound of 2-1/m is tight. If the makespan of the optimal preemptive schedule is defined by the ratio of the total processing times of r < m longest jobs over the total speed of r fastest machines, we show that the tight bound on the power of preemption is 2-1/min{r,m-r}.
  • Machine Scheduling
  • Uniform Parallel Machines
  • Power of Preemption


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads