Single parameter analysis of power of preemption on two and three uniform machines

DOI10.1016/j.disopt.2013.12.004zbMath1308.90068OpenAlexW2016656307MaRDI QIDQ2339808

Vitaly A. Strusevich, Alan J. Soper

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2013.12.004

zbMATH Keywords

schedulinguniform parallel machinespower of preemption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Parametric analysis of the quality of single preemption schedules on three uniform parallel machines, Schedules with a single preemption on uniform parallel machines, The benefit of preemption with respect to the \(\ell_p\) norm, Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines, The benefit of preemption for single machine scheduling so as to minimize total weighted completion time, Preemptive and non-preemptive scheduling on two unrelated parallel machines

Cites Work

• Unnamed Item
• Unnamed Item
• A linear compound algorithm for uniform machine scheduling
• A modified LPT algorithm for the two uniform parallel machine makespan minimization problem
• Bounds for LPT Schedules on Uniform Processors
• Preemptive Scheduling of Uniform Processor Systems
• A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines
• Parallel Processor Scheduling with Limited Number of Preemptions
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders