Convex programming for scheduling unrelated parallel machines
From MaRDI portal
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
Cited in
(28)- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines
- Graph balancing: a special case of scheduling unrelated parallel machines
- Convex quadratic programming relaxations for parallel machine scheduling with controllable processing times subject to release times
- All-Norm Approximation Algorithms
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
- Non-preemptive speed scaling
- scientific article; zbMATH DE number 1405788 (Why is no real title available?)
- Assigning sporadic tasks to unrelated machines
- Stochastic load balancing on unrelated machines
- Unrelated parallel machine scheduling -- perspectives and progress
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions
- Simpler and Better Algorithms for Minimum-Norm Load Balancing
- Concentration inequalities for nonlinear matroid intersection
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines
- Improved Lower Bounds for Non-utilitarian Truthfulness
- Concentration inequalities for nonlinear matroid intersection
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs
- Competitive algorithms for demand response management in a smart grid
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- Improved lower bounds for non-utilitarian truthfulness
- Tight bounds for selfish and greedy load balancing
- Trade-off between maximum flow time and energy intake in EV charging
- Scheduling two types of jobs with minimum makespan
- Minimum-norm load balancing Is (almost) as easy as minimizing makespan
- New results on a general class of minimum norm optimization problems
- Coupled and \(k\)-sided placements: generalizing generalized assignment
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)
