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 6 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)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- New approximation bounds for LPT scheduling (Q2379930) (← links)
- A Unified Approach to Truthful Scheduling on Related Machines (Q2800378) (← links)
- Worst-case analysis of LPT scheduling on a small number of non-identical processors (Q6072208) (← links)
