Pages that link to "Item:Q694192"
From MaRDI portal
The following pages link to On the optimality of list scheduling for online uniform machines scheduling (Q694192):
Displaying 7 items.
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- Lower bounds for online makespan minimization on a small number of related machines (Q398887) (← links)
- Competitive ratio of list scheduling on uniform machines and randomized heuristics (Q633543) (← links)
- Optimal online-list batch scheduling (Q990939) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- A 2-competitive largest job on least loaded machine online algorithm based on the multi list scheduling model (Q2079980) (← links)
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption (Q2344208) (← links)