Robust algorithms for preemptive scheduling
From MaRDI portal
Recommendations
- Robust algorithms for preemptive scheduling
- Robust algorithms for total completion time
- An optimal algorithm for preemptive on-line scheduling
- Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
- Preemptive online scheduling: Optimal algorithms for all speeds
Cites work
- scientific article; zbMATH DE number 3466528 (Why is no real title available?)
- scientific article; zbMATH DE number 6472625 (Why is no real title available?)
- A Level Algorithm for Preemptive Scheduling
- A Robust PTAS for Machine Covering and Packing
- A lower bound for on-line scheduling on uniformly related machines
- A lower bound for randomized on-line multiprocessor scheduling
- A robust APTAS for the classical bin packing problem
- AFPTAS results for common variants of bin packing: a new method for handling the small items
- An optimal algorithm for preemptive on-line scheduling
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation schemes for ordered vector packing problems
- Bounds for Certain Multiprocessing Anomalies
- Minimizing makespan and preemption costs on a system of uniform machines
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- On-Line Load Balancing for Related Machines
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- On-line scheduling revisited
- Online scheduling with bounded migration
- Optimal Preemptive Scheduling on Two-Processor Systems
- Optimal and online preemptive scheduling on uniformly related machines
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Optimal preemptive scheduling for general target functions
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Preemptive Scheduling of Uniform Processor Systems
- Preemptive on-line scheduling for two uniform processors
- Preemptive online scheduling with reordering
- Preemptive online scheduling: Optimal algorithms for all speeds
- Preemptive scheduling algorithms with nested processing set restriction
- Randomized on-line scheduling on two uniform machines
- Robust approximation schemes for cube packing
- Scheduling with deadlines and loss functions
- The Competitiveness of On-Line Assignments
- The power of preemption on unrelated machines and applications to scheduling orders
Cited in
(17)- Parallel solutions for preemptive makespan scheduling on two identical machines
- On robust online scheduling algorithms
- Robust online algorithms for dynamic choosing problems
- Robust algorithms for total completion time
- Symmetry exploitation for online machine covering with bounded migration
- Online Bin Covering with Limited Migration
- Online minimization of the maximum starting time: migration helps
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- A robust AFPTAS for online bin packing with polynomial migration
- Online load balancing with general reassignment cost
- Bin stretching with migration on two hierarchical machines
- Robust scheduling of metaprograms
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Speed-robust scheduling. Sand, bricks, and rocks
- Robust algorithms for preemptive scheduling
- Online bin covering with limited migration
- Online scheduling with migration on two hierarchical machines
This page was built for publication: Robust algorithms for preemptive scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472464)
