1 paper
Luc Libralesso, Pablo Andres Focke, Aurélien Secardin +1
We study an iterative beam search algorithm for the permutation flowshop (makespan and flowtime minimization). This algorithm combines branching strategies inspired by recent branc…