An improved NEH-based heuristic for the permutation flowshop problem.
Xingye DongHoukuan HuangPing ChenPublished in: Comput. Oper. Res. (2008)
Keyphrases
- permutation flowshop
- scheduling problem
- strongly np hard
- total flowtime
- upper bound
- tabu search
- greedy algorithm
- lower bound
- setup times
- approximation algorithms
- np hard
- branch and bound algorithm
- search algorithm
- single machine
- optimal solution
- parallel machines
- feasible solution
- minimizing makespan
- processing times
- search procedure
- lower and upper bounds
- constraint satisfaction
- dynamic programming