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.
@article{arxiv.2009.05800,
title = {Iterative beam search algorithms for the permutation flowshop},
author = {Luc Libralesso and Pablo Andres Focke and Aurélien Secardin and Vincent Jost},
journal= {arXiv preprint arXiv:2009.05800},
year = {2020}
}