Improved approximation schemes for scheduling unrelated parallel machines

DOI10.1145/301250.301361zbMath1345.90043OpenAlexW2103811745MaRDI QIDQ2819574

Lorant Porkolab, Klaus Jansen

Publication date: 29 September 2016

Published in: Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/301250.301361

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items

Bicriteria scheduling problem for unrelated parallel machines with release dates ⋮ A survey on offline scheduling with rejection ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Penalty cost constrained identical parallel machine scheduling problem ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs ⋮ Real-time scheduling with resource sharing on heterogeneous multiprocessors ⋮ Online Scheduling on a CPU-GPU Cluster ⋮ Minimizing flow time on a constant number of machines with preemption ⋮ Approximation schemes for scheduling and covering on unrelated machines