The following pages link to (Q3626419):
Displaying 8 items.
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines (Q862993) (← links)
- Optimal semi-online algorithms for machine covering (Q870840) (← links)
- Randomized algorithms for on-line scheduling problems: How low can't you go? (Q1612009) (← links)
- (Q4252304) (← links)
- Randomized on-line scheduling on two uniform machines (Q5937432) (← links)
- Mixed coordination mechanisms for scheduling games on hierarchical machines (Q6070429) (← links)
