Permutation Flow-shop : best-known makespans and schedules for Taillard and VFR benchmarks

For the Permutation Flow-shop scheduling problem with makespan minimization, the most frequently used benchmark instances are:

Eric Taillard, "Benchmarks for basic scheduling problems." European journal of operational research 64.2 (1993): 278-285, http://mistic.heig-vd.ch/taillard/problemes.dir/ordonnancement.dir/ordonnancement.html

Eva Vallada, Rubén Ruiz, Jose M. Framinan, "New hard benchmark for flowshop scheduling problems minimising makespan", European Journal of Operational Research, Volume 240, Issue 3, 2015, p. 666-677, https://doi.org/10.1016/j.ejor.2014.07.033.

For all 120 (resp. 480) instances, this dataset provides optimal (or best-known) makespans and schedules obtained by parallel Branch-and-Bound.

The instance data itself is also provided, as well as a small Python program that checks the correctness of provided schedules/makespans.