2 research outputs found
Iterative beam search algorithms for the permutation flowshop
We study an iterative beam search algorithm for the permutation flowshop
(makespan and flowtime minimization). This algorithm combines branching
strategies inspired by recent branch-and-bounds and a guidance strategy
inspired by the LR heuristic. It obtains competitive results, reports many
new-best-so-far solutions on the VFR benchmark (makespan minimization) and the
Taillard benchmark (flowtime minimization) without using any NEH-based
branching or iterative-greedy strategy. The source code is available at:
https://gitlab.com/librallu/cats-pfsp