Robust algorithms for preemptive scheduling
From MaRDI portal
Publication:472464
DOI10.1007/S00453-012-9718-3zbMATH Open1307.68091OpenAlexW2153644134MaRDI QIDQ472464FDOQ472464
Authors: Leah Epstein, Asaf Levin 
Publication date: 19 November 2014
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-012-9718-3
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
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35) Nonnumerical algorithms (68W05)
Cites Work
- On-line scheduling revisited
- Preemptive online scheduling with reordering
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- The Competitiveness of On-Line Assignments
- Bounds for Certain Multiprocessing Anomalies
- Approximation algorithms for scheduling unrelated parallel machines
- Title not available (Why is that?)
- An optimal algorithm for preemptive on-line scheduling
- Scheduling with deadlines and loss functions
- A lower bound for randomized on-line multiprocessor scheduling
- Preemptive Scheduling of Uniform Processor Systems
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
- A robust APTAS for the classical bin packing problem
- Randomized on-line scheduling on two uniform machines
- Approximation schemes for ordered vector packing problems
- Optimal Preemptive Scheduling on Two-Processor Systems
- Minimizing makespan and preemption costs on a system of uniform machines
- AFPTAS results for common variants of bin packing: a new method for handling the small items
- A Robust PTAS for Machine Covering and Packing
- Preemptive online scheduling: Optimal algorithms for all speeds
- Preemptive on-line scheduling for two uniform processors
- A lower bound for on-line scheduling on uniformly related machines
- A Level Algorithm for Preemptive Scheduling
- On-Line Load Balancing for Related Machines
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Title not available (Why is that?)
- Optimal preemptive scheduling for general target functions
- Online scheduling with bounded migration
- The power of preemption on unrelated machines and applications to scheduling orders
- Optimal and online preemptive scheduling on uniformly related machines
- Robust approximation schemes for cube packing
- Preemptive scheduling algorithms with nested processing set restriction
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Cited In (17)
- 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 minimization of the maximum starting time: migration helps
- Online Bin Covering with Limited Migration
- A robust AFPTAS for online bin packing with polynomial migration
- Robust polynomial-time approximation schemes for parallel machine scheduling with job arrivals and departures
- Bin stretching with migration on two hierarchical machines
- Online load balancing with general reassignment cost
- 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
- Parallel solutions for preemptive makespan scheduling on two identical 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)
