On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes.
Klaus JansenLorant PorkolabPublished in: SIAM J. Discret. Math. (2006)
Keyphrases
- approximation schemes
- approximation algorithms
- scheduling problem
- np hard
- special case
- worst case
- scheduling algorithm
- resource allocation
- numerical methods
- round robin
- hard constraints
- parallel processors
- computational complexity
- error metrics
- resource constraints
- processing times
- integer programming
- polynomial time approximation
- higher order
- multiscale