Pages that link to "Item:Q1041344"
From MaRDI portal
The following pages link to Optimal and online preemptive scheduling on uniformly related machines (Q1041344):
Displaying 8 items.
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
