Pages that link to "Item:Q1026246"
From MaRDI portal
The following pages link to Tighter approximation bounds for LPT scheduling in two special cases (Q1026246):
Displaying 12 items.
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Bounds on delay start LPT algorithm for scheduling on two identical machines in the \(l_p\) norm (Q1008788) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs (Q2093193) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- A unified approach to truthful scheduling on related machines (Q2800378) (← links)
- An experimental study of LP-based approximation algorithms for scheduling problems (Q2890462) (← links)
- (Q4368203) (← links)
- A note on LPT scheduling (Q5906502) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)