Iterative beam search algorithms for the permutation flowshop

Luc Libralesso (1) , Pablo Andres Focke , Aurélien Secardin (1) , Vincent Jost (1)

1 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production

We study an iterative beam search algorithm for the permutation flowshop (makespan and flow-time 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.

Domaines: Informatique [cs]

Luc Libralesso, Pablo Andres Focke, Aurélien Secardin, Vincent Jost. Iterative beam search algorithms for the permutation flowshop. 2020. ⟨hal-02937115⟩