Pages that link to "Item:Q1588054"
From MaRDI portal
The following pages link to New algorithms for related machines with temporary jobs. (Q1588054):
Displaying 5 items.
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)