Results for Permutation Flowshop Scheduling Problems
This repository contains all the problem sets for Permutation Flowshop Scheduling, by Carlier, Heller, Lahiri, Reeves and Taillard. All problems are accompanied by their solutions in the form of permutations, in a format corresponding to Matlab data files (.mat), obtained with an evolutionary algorithm. The "Verification of the result" folder includes the program 'solutionCheck.m' for checking the correctness of the solution given by the permutations included in the other folders. In the folder 'Lower Bound', there is a pdf file 'LB correction' where you can find an important remark concerning LB calculation with E. Taillard's formulas. The folder contains a Matlab code for Lower Bound calculation, according to the this remark.
Steps to reproduce
These results were obtained with an evolutionary algorithm. They can be used as starting solutions in heuristic improvement algorithms.