Polynomial time approximation algorithms for proportionate open-shop scheduling.
B. NaderiMostafa ZandiehMehdi YazdaniPublished in: Int. Trans. Oper. Res. (2014)
Keyphrases
- approximation algorithms
- open shop scheduling
- open shop
- special case
- np hard
- approximation ratio
- worst case
- ant colony optimisation
- np hardness
- vertex cover
- minimum cost
- primal dual
- disjoint paths
- precedence constraints
- set cover
- polynomial time approximation
- approximation guarantees
- scheduling problem
- combinatorial auctions
- upper bound
- computational complexity