An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion.
Xingye DongHoukuan HuangPing ChenPublished in: Comput. Oper. Res. (2009)
Keyphrases
- total flowtime
- permutation flowshop
- search algorithm
- scheduling problem
- minimizing makespan
- upper bound
- flowshop scheduling problems
- flowshop
- greedy algorithm
- flowshop scheduling
- branch and bound
- single machine
- tabu search
- processing times
- strongly np hard
- search space
- np hard
- lower bound
- parallel machines
- approximation algorithms
- precedence constraints
- single machine scheduling problem
- sequence dependent setup times
- response time