Convex programming for scheduling unrelated parallel machines

DOI10.1145/1060590.1060639zbMATH Open1192.90059OpenAlexW2104144451MaRDI QIDQ3581397FDOQ3581397

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

Recommendations

Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
Parallel machine scheduling with a convex resource consumption function
Approximating scheduling unrelated parallel machines in parallel
Approximation algorithms for scheduling unrelated parallel machines
A unified approach to scheduling on unrelated parallel machines
Improved approximation schemes for scheduling unrelated parallel machines
Algorithms for the unrelated parallel machine scheduling problem with a resource constraint
Unrelated parallel machine scheduling -- perspectives and progress
Optimal scheduling of parallel machines with constrained resources

Mathematics Subject Classification ID

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

Cited In (24)

Improved Lower Bounds for Non-utilitarian Truthfulness
Simpler and Better Algorithms for Minimum-Norm Load Balancing
Stochastic load balancing on unrelated machines
Title not available (Why is that?)
Non-preemptive speed scaling
On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
Concentration inequalities for nonlinear matroid intersection
All-Norm Approximation Algorithms
Tight bounds for selfish and greedy load balancing
Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
Graph balancing: a special case of scheduling unrelated parallel machines
Coupled and \(k\)-sided placements: generalizing generalized assignment
Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
Concentration inequalities for nonlinear matroid intersection
Improved lower bounds for non-utilitarian truthfulness
Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
Assigning sporadic tasks to unrelated machines
An Optimal Control Framework for Online Job Scheduling with General Cost Functions
Unrelated parallel machine scheduling -- perspectives and progress
Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs
Competitive algorithms for demand response management in a smart grid
Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3581397)