This report presents solutions that, as of the date of publication, improve the cost (makespan) for 52 instances of the Permutation Flow-Shop Problem (PFSP) proposed by Eric Taillard or by Eva Vallada, Rubén Ruiz, and Jose M. Framinan. This report may help those who assess the quality of heuristics based on their ability to approach the best-known solutions. Three algorithmic techniques used are also presented: the super-prohibition sieve excluding paths
with weights exceeding a given bound, the adaptive compartmental neighborhood with selective 2-closing, and finally the makespan calculation performed using upper-windowed multi-numbers.
Publication Date: 2026-06-05