Login / Signup
An improved NEH heuristic to minimize makespan in permutation flow shops.
Pawel Jan Kalczynski
Jerzy Kamburowski
Published in:
Comput. Oper. Res. (2008)
Keyphrases
</>
optimal solution
dynamic programming
simulated annealing
combinatorial optimization
search algorithm
state space
branch and bound algorithm
permutation flowshop
information systems
search strategies
heuristic methods
bin packing
real time
tabu search
solution quality
heuristic solution