Pages that link to "Item:Q633543"
From MaRDI portal
The following pages link to Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543):
Displaying 5 items.
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Online scheduling on uniform machines with two hierarchies (Q1928505) (← links)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)
- Semi-online scheduling on two uniform parallel machines with initial lookahead (Q6594037) (← links)
