Preemptive Online Scheduling: Optimal Algorithms for All Speeds
From MaRDI portal
Recommendations
- Preemptive online scheduling: Optimal algorithms for all speeds
- Optimal and online preemptive scheduling on uniformly related machines
- STACS 2004
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios
Cited in
(14)- Preemptive online scheduling: Optimal algorithms for all speeds
- Optimal and online preemptive scheduling on uniformly related machines
- An optimal algorithm for preemptive on-line scheduling
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- Optimal preemptive scheduling for general target functions
- Optimal preemptive scheduling on uniform processors with non-decreasing speed ratios
- A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm
- STACS 2004
- Optimal preemptive scheduling for general target functions
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Preemptive scheduling on a small number of hierarchical machines
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
This page was built for publication: Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449539)