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.本仓库收录了由Carlier、Heller、Lahiri、Reeves及Taillard等人提出的全部置换流水车间调度（Permutation Flowshop Scheduling）问题集。所有问题均配套以排列形式呈现的求解结果，此类结果通过进化算法生成，并采用与Matlab数据文件（.mat）匹配的格式存储。 “结果验证”文件夹内置程序`solutionCheck.m`，可用于校验其他文件夹中排列形式对应的调度解的正确性。 在“下界”文件夹中，存有一份名为《LB修正》的PDF文档，其中包含关于使用E. Taillard公式进行下界（Lower Bound，简称LB）计算的重要备注。该文件夹同时提供依据该备注编写的Matlab下界计算代码。