Login / Signup
Iterated-greedy-based algorithms with beam search initialization for the permutation flowshop to minimise total tardiness.
Victor Fernandez-Viagas
Jorge M. S. Valente
Jose M. Framiñan
Published in:
Expert Syst. Appl. (2018)
Keyphrases
</>
beam search
scheduling problem
total tardiness
permutation flowshop
parallel machines
search algorithm
multi objective
np hard
ranking algorithm
ranking functions