Robust Algorithms for Preemptive Scheduling
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 567-578
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Preemptive Online Scheduling: Optimal Algorithms for All SpeedsAlgorithmica, 2008
- A robust APTAS for the classical bin packing problemMathematical Programming, 2007
- Minimizing Makespan and Preemption Costs on a System of Uniform MachinesAlgorithmica, 2005
- Approximation schemes for ordered vector packing problemsNaval Research Logistics (NRL), 2002
- On-Line Load Balancing for Related MachinesJournal of Algorithms, 2000
- Preemptive on-line scheduling for two uniform processorsOperations Research Letters, 1998
- A lower bound for randomized on-line multiprocessor schedulingInformation Processing Letters, 1997
- An optimal algorithm for preemptive on-line schedulingOperations Research Letters, 1995
- The Competitiveness of On-Line AssignmentsJournal of Algorithms, 1995
- On Preemptive Scheduling of Unrelated Parallel Processors by Linear ProgrammingJournal of the ACM, 1978