Pages that link to "Item:Q3581397"
From MaRDI portal
The following pages link to Convex programming for scheduling unrelated parallel machines (Q3581397):
Displaying 24 items.
- Non-preemptive speed scaling (Q398859) (← links)
- Assigning sporadic tasks to unrelated machines (Q494326) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Coupled and \(k\)-sided placements: generalizing generalized assignment (Q896299) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines (Q2341395) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm (Q3511378) (← links)
- Convex quadratic programming relaxations for network scheduling problems (Q4938773) (← links)
- Stochastic Load Balancing on Unrelated Machines (Q4991668) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions (Q5058033) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines (Q5419000) (← links)
- Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369) (← links)
- (Q5743409) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
- Competitive algorithms for demand response management in a smart grid (Q6124769) (← links)