Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Iterative beam search algorithms for the permutation flowshop

Luc Libralesso 1 Pablo Focke Aurélien Secardin 1 Vincent Jost 1
1 G-SCOP_ROSP [2020-....] - Recherche Opérationnelle pour les Systèmes de Production [2020-....]
G-SCOP [2020-....] - Laboratoire des sciences pour la conception, l'optimisation et la production [2020-....]
Abstract : 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:
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [18 references]  Display  Hide  Download
Contributor : Luc Libralesso <>
Submitted on : Saturday, September 12, 2020 - 4:14:44 PM
Last modification on : Wednesday, October 14, 2020 - 4:12:05 AM


Files produced by the author(s)


  • HAL Id : hal-02937115, version 1



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



Record views


Files downloads