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 19 items.
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- On the optimality of list scheduling for online uniform machines scheduling (Q694192) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Online scheduling on semi-related machines (Q963475) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- On-line preemptive scheduling on uniform machines (Q1348609) (← links)
- A survey on makespan minimization in semi-online environments (Q1617278) (← links)
- Optimal preemptive semi-online scheduling to minimize makespan on two related machines (Q1866010) (← links)
- An optimal algorithm for preemptive on-line scheduling (Q1919176) (← 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)
- Optimal preemptive scheduling for general target functions (Q2581760) (← links)
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines (Q5009625) (← links)
- STACS 2004 (Q5309700) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311130) (← links)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios (Q5949924) (← links)
- Parallel solutions for preemptive makespan scheduling on two identical machines (Q6102847) (← links)
