Preemptive online scheduling: Optimal algorithms for all speeds
From MaRDI portal
Recommendations
Cites work
- A Level Algorithm for Preemptive Scheduling
- A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
- A lower bound for on-line scheduling on uniformly related machines
- A lower bound for randomized on-line multiprocessor scheduling
- A lower bound for randomized on-line scheduling algorithms
- An optimal algorithm for preemptive on-line scheduling
- Bounds for Certain Multiprocessing Anomalies
- On randomized online scheduling
- On-Line Load Balancing for Related Machines
- On-line scheduling revisited
- Optimal and online preemptive scheduling on uniformly related machines
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Scheduling of Uniform Processor Systems
- Preemptive on-line scheduling for two uniform processors
- Randomized on-line scheduling on three processors.
- Randomized on-line scheduling on two uniform machines
- STACS 2004
- Scheduling with deadlines and loss functions
Cited in
(24)- Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Robust algorithms for preemptive scheduling
- Online bin stretching with three bins
- scientific article; zbMATH DE number 1688367 (Why is no real title available?)
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Optimal preemptive scheduling for general target functions
- STACS 2004
- A lower bound on deterministic online algorithms for scheduling on related machines without preemption
- Robust algorithms for preemptive scheduling
- Lower bounds for online makespan minimization on a small number of related machines
- Preemptive online scheduling with rejection of unit jobs on two uniformly related machines
- Better Algorithms for Online Bin Stretching
- Mathematical Foundations of Computer Science 2004
- Semi-online preemptive scheduling: one algorithm for all variants
- On the optimality of list scheduling for online uniform machines scheduling
- Online makespan minimization: the power of restart
- Semi-online scheduling: a survey
- On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Optimal and online preemptive scheduling on uniformly related machines
- A two-phase algorithm for bin stretching with stretching factor 1.5
- Parallel solutions for preemptive makespan scheduling on two identical machines
- Preemptive Online Scheduling: Optimal Algorithms for All Speeds
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 Q1016520)
