Tighter approximation bounds for LPT scheduling in two special cases.
Annamária KovácsPublished in: J. Discrete Algorithms (2009)
Keyphrases
- special case
- worst case
- upper bound
- approximation algorithms
- lower bound
- error bounds
- polynomial time approximation
- np hard
- scheduling problem
- approximation ratio
- lp norm
- approximation methods
- stage stochastic programs
- upper and lower bounds
- worst case analysis
- constant factor
- error tolerance
- computational complexity
- scheduling algorithm
- closed form
- dynamic scheduling
- average case
- approximation guarantees
- round robin
- real time database systems
- greedy algorithm
- lower and upper bounds
- linear functions
- approximation schemes
- resource constraints
- vc dimension
- flexible manufacturing systems
- branch and bound
- resource allocation