Iterative beam search algorithms for the permutation flowshop.

Luc Libralesso Pablo Andres Focke Aurélien Secardin Vincent Jost

Published in: Eur. J. Oper. Res. (2022)

Keyphrases

permutation flowshop
search algorithm
scheduling problem
total flowtime
upper bound
greedy algorithm
strongly np hard
tabu search
search space
flowshop
path finding
single machine
heuristic search
precedence constraints
particle swarm optimization
np hard
lower bound