An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem

Computers & OR, Volume 81, Issue C, 2017, Pages 160-166.

Cited by: 13|Bibtex|Views20|Links
EI

Abstract:

We present a new iterated greedy algorithm for the permutation flowshop problem under makespan objective.Our algorithm applies local search on partial solutions after the destruction phase.Our algorithm compares favorably with others from the literature on available benchmark sets.The experiments show that adding local search on partial s...More

Code:

Data:

Your rating :
0

 

Tags
Comments