Approximation algorithms for the three-stage flexible flow shop problem with mid group constraint.
Zhantao LiJianjun LiuQing-xin ChenNing MaoXiaoming WangPublished in: Expert Syst. Appl. (2015)
Keyphrases
- approximation algorithms
- open shop
- flowshop
- special case
- scheduling problem
- np hard
- strongly np hard
- vertex cover
- worst case
- manufacturing cell
- minimum cost
- flowshop scheduling
- job shop
- tabu search
- sequence dependent setup times
- single machine
- primal dual
- precedence constraints
- constant factor
- genetic algorithm
- randomized algorithms
- integer programming
- flowshop scheduling problems
- np complete
- approximation ratio
- processing times
- parallel computing
- multi item
- combinatorial auctions
- lower bound