Pages that link to "Item:Q2432529"
From MaRDI portal
The following pages link to The expected competitive ratio for weighted completion time scheduling (Q2432529):
Displaying 4 items.
- An improved greedy algorithm for stochastic online scheduling on unrelated machines (Q2688463) (← links)
- Unrelated Machine Scheduling with Stochastic Processing Times (Q3186530) (← links)
- Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Q5131543) (← links)
- STACS 2004 (Q5309736) (← links)