Pages that link to "Item:Q472464"
From MaRDI portal
The following pages link to Robust algorithms for preemptive scheduling (Q472464):
Displayed 12 items.
- Robust algorithms for total completion time (Q2010916) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Online scheduling with migration on two hierarchical machines (Q2091110) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Symmetry exploitation for online machine covering with bounded migration (Q5009591) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- Bin stretching with migration on two hierarchical machines (Q6093406) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
- Online minimization of the maximum starting time: migration helps (Q6174813) (← links)