Pages that link to "Item:Q2344208"
From MaRDI portal
The following pages link to A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208):
Displaying 9 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)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Starting time minimization for the maximum job variant (Q2057591) (← links)
- Online makespan scheduling with job migration on uniform machines (Q2067667) (← links)
- Tight lower bounds for semi-online scheduling on two uniform machines with known optimum (Q2323435) (← links)
- Semi-online scheduling: a survey (Q2669808) (← links)
- Online Makespan Scheduling with Job Migration on Uniform Machines (Q5009583) (← links)
- Online load balancing on uniform machines with limited migration (Q6106523) (← links)