Lower bounds & competitive algorithms for online scheduling of unit-size tasks to related machines.
Spyros C. KontogiannisPublished in: STOC (2002)
Keyphrases
- lower bound
- online algorithms
- computational complexity
- running times
- times faster
- parallel machines
- parallel processors
- data structure
- computational cost
- worst case
- computationally efficient
- theoretical analysis
- orders of magnitude
- machine learning algorithms
- preventive maintenance
- lower and upper bounds
- space complexity
- scheduling algorithm
- reinforcement learning
- optimal solution
- objective function