Convex programming for scheduling unrelated parallel machines

DOI10.1145/1060590.1060639zbMath1192.90059OpenAlexW2104144451MaRDI QIDQ3581397

Amir Epstein, Yossi Azar

Publication date: 16 August 2010

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

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

Mathematics Subject Classification ID

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

Related Items (21)

An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ Non-preemptive speed scaling ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Coupled and \(k\)-sided placements: generalizing generalized assignment ⋮ Competitive algorithms for demand response management in a smart grid ⋮ Improved lower bounds for non-utilitarian truthfulness ⋮ A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm ⋮ Structural parameters for scheduling with assignment restrictions ⋮ Tight bounds for selfish and greedy load balancing ⋮ Graph balancing: a special case of scheduling unrelated parallel machines ⋮ Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints ⋮ Assigning sporadic tasks to unrelated machines ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs ⋮ Improved Lower Bounds for Non-utilitarian Truthfulness ⋮ Simpler and Better Algorithms for Minimum-Norm Load Balancing ⋮ Stochastic Load Balancing on Unrelated Machines ⋮ Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines ⋮ Concentration inequalities for nonlinear matroid intersection ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines ⋮ Unnamed Item

This page was built for publication: Convex programming for scheduling unrelated parallel machines