Pages that link to "Item:Q3452224"
From MaRDI portal
The following pages link to A unified approach to scheduling on unrelated parallel machines (Q3452224):
Displaying 12 items.
- Approximation algorithms for clustering with dynamic points (Q2168849) (← links)
- Non-clairvoyantly scheduling to minimize convex functions (Q2319644) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- Graph balancing: a special case of scheduling unrelated parallel machines (Q2441586) (← links)
- Randomized Rounding in the Presence of a Cardinality Constraint (Q2828177) (← links)
- Tight Bounds for Online Vector Scheduling (Q4620410) (← links)
- Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines (Q4997316) (← links)
- Simpler and Better Algorithms for Minimum-Norm Load Balancing (Q5075764) (← links)
- Concentration inequalities for nonlinear matroid intersection (Q5252262) (← links)
- (Q5743409) (← links)
- (Q5743474) (← links)
- Approximating weighted completion time via stronger negative correlation (Q6620463) (← links)
