Approximation algorithms for two-stage flexible flow shop scheduling.
Minghui ZhangYan LanXin HanPublished in: J. Comb. Optim. (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- facility location problem
- vertex cover
- scheduling problem
- exact algorithms
- primal dual
- network design problem
- approximation ratio
- undirected graph
- open shop
- np hardness
- set cover
- disjoint paths
- constant factor
- randomized algorithms
- approximation schemes
- constant factor approximation
- knapsack problem
- precedence constraints
- spanning tree
- processing times
- dynamic programming
- lower bound
- search algorithm
- optimal solution