Login / Signup
NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness.
Victor Fernandez-Viagas
Jose M. Framiñan
Published in:
Comput. Oper. Res. (2015)
Keyphrases
</>
total tardiness
scheduling problem
single machine
permutation flowshop
parallel machines
setup times
flowshop
sequence dependent setup times
search algorithm
branch and bound algorithm
processing times
tabu search
dynamic programming
single machine scheduling problem
computer systems
graph cuts
np hard