Pages that link to "Item:Q3434556"
From MaRDI portal
The following pages link to Tighter Approximation Bounds for LPT Scheduling in Two Special Cases (Q3434556):
Displaying 9 items.
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Bounds on delay start LPT algorithm for scheduling on two identical machines in the \(l_p\) norm (Q1008788) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← 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)
- (Q4368203) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- A note on LPT scheduling (Q5906502) (← links)
- Related machine scheduling with machine speeds satisfying linear constraints (Q5918518) (← links)