An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem.
Jérémie Dubois-LacosteFederico PagnozziThomas StützlePublished in: Comput. Oper. Res. (2017)
Keyphrases
- permutation flowshop
- greedy algorithm
- partial solutions
- total flowtime
- scheduling problem
- iterated greedy
- squeaky wheel
- greedy algorithms
- worst case
- upper bound
- dynamic programming
- search space
- greedy strategy
- set cover
- objective function
- knapsack problem
- optimization problems
- flowshop
- np hard
- strongly np hard
- lower bound
- tabu search
- computational complexity