Permutation Flow-shop : Taillard and VFR benchmarks best known solutions (updated according to linked report)

This dataset completes the report of the same author (Olivier Brunner) that can be viewed at : https://doi.org/10.5281/zenodo.15696776 It is composed of three consistant CSV files - i.e. with the same columns. The report abstract is : This report presents some solutions that, as of the date of publication, improve the cost (makespan) for some 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. The same versioning is used for the report and for the dataset. The dataset was created and starts at version 5 of the report. This dataset reflects an ongoing work. Further updates will be posted until every open instance has been tested. This dataset is based on the best known solutions sumerized and uploaded by Jan Gmys in feb, 2021. It can be viewed at : https://doi.org/10.5281/zenodo.4542886本数据集补充了同一作者奥利维耶·布伦纳（Olivier Brunner）的相关报告，该报告可通过以下链接查阅：https://doi.org/10.5281/zenodo.15696776 本数据集包含三份结构一致的逗号分隔值（Comma-Separated Values, CSV）文件——即各文件拥有完全相同的列字段。 本报告的摘要如下： 本报告呈现了若干截至发布之日可优化埃里克·泰拉尔（Eric Taillard）、或是伊娃·巴利亚达（Eva Vallada）、鲁文·鲁伊斯（Rubén Ruiz）与何塞·M·弗拉米南（Jose M. Framinan）提出的部分排列流水车间问题（Permutation Flow-Shop Problem, PFSP）实例的最大完工跨度（makespan）的解决方案。本报告可为基于最优已知解求解能力评估启发式算法性能的研究人员提供参考。 本数据集与该报告采用相同的版本编号规则，数据集自报告的第5版起同步创建。 本数据集对应一项仍在推进的研究工作，后续将持续更新，直至所有开放实例均完成测试。 本数据集基于扬·米斯（Jan Gmys）于2021年2月汇总并上传的最优已知解构建，相关原始数据可通过以下链接查阅：https://doi.org/10.5281/zenodo.4542886