The following pages link to (Q4051611):
Displaying 11 items.
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- A study of scheduling problems with preemptions on multi-core computers with GPU accelerators (Q499342) (← links)
- Tighter approximation bounds for LPT scheduling in two special cases (Q1026246) (← links)
- First fit decreasing scheduling on uniform multiprocessors (Q1061602) (← links)
- Efficient scheduling of tasks without full use of processor resources (Q1145998) (← links)
- A note on on-line scheduling with precedence constraints on identical machines (Q1607065) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Greed in resource scheduling (Q2277135) (← links)
- Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)