Tighter Approximation Bounds for LPT Scheduling in Two Special Cases.
Annamária KovácsPublished in: CIAC (2006)
Keyphrases
- special case
- worst case
- upper bound
- approximation algorithms
- lower bound
- error bounds
- polynomial time approximation
- np hard
- scheduling problem
- approximation ratio
- upper and lower bounds
- stage stochastic programs
- lp norm
- approximation guarantees
- constant factor
- error tolerance
- lower and upper bounds
- approximation methods
- scheduling algorithm
- resource constraints
- worst case analysis
- sample complexity
- parallel machines
- greedy algorithm
- resource allocation
- computational complexity
- linear programming relaxation
- round robin
- average case
- neural network
- single machine
- closed form
- real time database systems
- flexible manufacturing systems
- approximation schemes
- sample size
- worst case bounds