Pages that link to "Item:Q3423277"
From MaRDI portal
The following pages link to An absolute approximation algorithm for scheduling unrelated machines (Q3423277):
Displaying 8 items.
- Approximate algorithms for unrelated machine scheduling to minimize makespan (Q747046) (← links)
- Approximation algorithms for scheduling unrelated parallel machines (Q751989) (← links)
- An almost ideal coordination mechanism for unrelated machine scheduling (Q1733383) (← links)
- An optimal rounding gives a better approximation for scheduling unrelated machines (Q2488212) (← links)
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget (Q3004675) (← links)
- On the Configuration-LP for Scheduling on Unrelated Machines (Q3092258) (← links)
- Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines (Q5074358) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)