Fully Polynomial Time Approximation Schemes for Scheduling Divisible Loads.
Joanna BerlinskaPublished in: PPAM (2) (2009)
Keyphrases
- approximation schemes
- approximation algorithms
- np hard
- scheduling problem
- special case
- scheduling algorithm
- worst case
- response time
- load balancing
- resource allocation
- round robin
- parallel machines
- error metrics
- search algorithm
- polynomial time approximation
- resource constraints
- numerical methods
- constraint satisfaction problems
- natural images
- image analysis
- computational complexity