A unified approach to scheduling on unrelated parallel machines

DOI10.1145/1552285.1552289zbMath1325.90044OpenAlexW2015231501MaRDI QIDQ3452224

Aravind Srinivasan, Srinivasan Parthasarathy, V. S. Anil Kumar, Madhav V. Marathe

Publication date: 11 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsrandomized roundingscheduling under multiple criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (11)

Approximation algorithms for clustering with dynamic points ⋮ Graph balancing: a special case of scheduling unrelated parallel machines ⋮ Tight Bounds for Online Vector Scheduling ⋮ Simpler and Better Algorithms for Minimum-Norm Load Balancing ⋮ Randomized Rounding in the Presence of a Cardinality Constraint ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ Concentration inequalities for nonlinear matroid intersection ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: A unified approach to scheduling on unrelated parallel machines