Preemptive Online Scheduling: Optimal Algorithms for All Speeds.
Tomás EbenlendrWojciech JaworJirí SgallPublished in: Algorithmica (2009)
Keyphrases
- theoretical analysis
- scheduling algorithm
- orders of magnitude
- dynamic programming
- worst case
- efficient algorithms for computing
- data structure
- computationally efficient
- data mining
- scheduling problem
- online learning
- optimal solution
- exhaustive search
- online algorithms
- high speed
- data mining techniques
- significant improvement
- computational complexity
- computational efficiency
- single machine
- learning algorithm
- optimal strategy
- competitive ratio
- neural network