Improved approximation algorithms for two-stage flexible flow shop scheduling.
Anzhen PengLongcheng LiuWeifeng LinPublished in: J. Comb. Optim. (2021)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- facility location problem
- set cover
- open shop
- minimum cost
- exact algorithms
- primal dual
- randomized algorithms
- scheduling problem
- network design problem
- np hardness
- approximation ratio
- undirected graph
- disjoint paths
- precedence constraints
- lower bound
- learning algorithm
- objective function
- genetic algorithm