Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion.
Hongyan SangQuan-Ke PanJun-Qing LiPing WangYu-Yan HanKai-Zhou GaoPeng DuanPublished in: Swarm Evol. Comput. (2019)
Keyphrases
- permutation flowshop
- total flowtime
- scheduling problem
- flowshop scheduling problems
- upper bound
- optimization problems
- minimizing makespan
- greedy algorithm
- flowshop
- combinatorial optimization
- flowshop scheduling
- worst case
- strongly np hard
- distributed systems
- computational complexity
- genetic algorithm
- parallel machines
- lower and upper bounds
- setup times
- lower bound