Complexity of preemptive minsum scheduling on unrelated parallel machines

DOI10.1016/J.JALGOR.2004.06.011zbMath1101.68430OpenAlexW3089811425MaRDI QIDQ5704855

R. A. Sitters

Publication date: 16 November 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2004.06.011

zbMATH Keywords

NP-hardSchedulingPreemptionTotal completion time

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ Minimizing the stretch when scheduling flows of divisible requests ⋮ Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Approximability of average completion time scheduling on unrelated machines ⋮ Minimizing Average Flow Time on Unrelated Machines ⋮ Preemptive scheduling on uniform machines to minimize mean flow time ⋮ Scheduling meets \(n\)-fold integer programming

This page was built for publication: Complexity of preemptive minsum scheduling on unrelated parallel machines