Minimizing makespan and preemption costs on a system of uniform machines
From MaRDI portal
Publication:818662
DOI10.1007/s00453-005-1171-0zbMath1086.90028MaRDI QIDQ818662
Gerhard J. Woeginger, Tami Tamir, Hadas Shachnai
Publication date: 21 March 2006
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-005-1171-0
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Preemptive Scheduling on Selfish Machines, Mathematical programming algorithms for bin packing problems with item fragmentation, An AFPTAS for variable sized bin packing with general activation costs, Robust algorithms for preemptive scheduling, Approximation schemes for packing with item fragmentation, Optimal and online preemptive scheduling on uniformly related machines, Algorithms with limited number of preemptions for scheduling on parallel machines, How small are shifts required in optimal preemptive schedules?, Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times