Iterative beam search algorithms for the permutation flowshop
2020-09-12Code Available0· sign in to hype
Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost
Code Available — Be the first to reproduce this paper.
ReproduceCode
- gitlab.com/librallu/cats-pfspOfficialIn papernone★ 0
Abstract
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.