Approximation algorithms for parallel open shop scheduling.
Yong ChenAn ZhangGuangting ChenJianming DongPublished in: Inf. Process. Lett. (2013)
Keyphrases
- approximation algorithms
- open shop scheduling
- special case
- np hard
- vertex cover
- minimum cost
- worst case
- approximation ratio
- precedence constraints
- ant colony optimisation
- set cover
- constant factor
- randomized algorithms
- approximation schemes
- primal dual
- approximation guarantees
- open shop
- shared memory
- combinatorial auctions
- lower bound