The benefit of preemption for single machine scheduling so as to minimize total weighted completion time

DOI10.1016/J.ORL.2016.09.013zbMath1408.90125OpenAlexW2529680039MaRDI QIDQ1709959

Asaf Levin, Leah Epstein

Publication date: 15 January 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.09.013

zbMATH Keywords

schedulingrelease datespreemptive schedulepower of preemption

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Parametric analysis of the quality of single preemption schedules on three uniform parallel machines ⋮ An exact algorithm for the preemptive single machine scheduling of equal-length jobs ⋮ Schedules with a single preemption on uniform parallel machines ⋮ The benefit of preemption with respect to the \(\ell_p\) norm ⋮ Preemptive and non-preemptive scheduling on two unrelated parallel machines

Cites Work

• A tight lower bound for the best-\(\alpha\) algorithm
• A comment on scheduling on uniform machines under chain-type precedence constraints
• Single parameter analysis of power of preemption on two and three uniform machines
• Approximation Techniques for Average Completion Time Scheduling
• Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
• The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders

This page was built for publication: The benefit of preemption for single machine scheduling so as to minimize total weighted completion time