Efficient Approximation Algorithms for the Bounded Flexible Scheduling Problem in Clouds.
Longkun GuoHong ShenPublished in: IEEE Trans. Parallel Distributed Syst. (2017)
Keyphrases
- approximation algorithms
- np hard
- scheduling problem
- special case
- vertex cover
- worst case
- precedence constraints
- minimum cost
- facility location problem
- network design problem
- strongly np hard
- primal dual
- flowshop
- np hardness
- set cover
- polynomial time approximation
- approximation schemes
- randomized algorithms
- lower bound
- job shop scheduling problem
- single machine
- approximation ratio
- greedy heuristic
- processing times
- optimal solution
- open shop