Pareto fronts of the Flexible Job Shop Scheduling Problem from Fattahi's benchmark

Pareto fronts (PF) found by a parallel Branch and bound. The data was obtained by a parallel branch-and-bound with shared memory architecture. A total of 24 threads were used with a time limit of 120 hours. The Pareto fronts are from Fattahi's benchmark. The objectives are the makespan, max workload, and total workload. The optimal Pareto fronts found are from SFJS1 to SFJS10 and MSFJ1 to MFJS2. From MFJS3 to MFJS10 are the Pareto fronts found by a Branch-and-Bound algorithm. The data contains a Readme file with a long description.本数据集包含由并行分支定界法（parallel Branch and bound）求解得到的帕累托前沿（Pareto fronts）。该数据依托共享内存架构的并行分支定界法生成，共计启用24个线程，计算时限设定为120小时。本次涉及的帕累托前沿源自Fattahi基准测试集，优化目标涵盖最大完工时间（makespan）、最大工作负载与总工作负载。其中，SFJS1至SFJS10以及MSFJ1至MFJS2对应的帕累托前沿为最优帕累托前沿；MFJS3至MFJS10的帕累托前沿则由分支定界算法（Branch-and-Bound algorithm）求解得到。数据集附带一份Readme文件，其中包含详尽的描述说明。

搜集汇总

背景与挑战

背景概述

该数据集包含柔性作业车间调度问题在Fattahi基准测试中的帕累托前沿，通过并行分支定界算法计算得到，目标函数涉及完工时间、最大工作量和总工作量。数据集覆盖多个实例，其中部分为最优帕累托前沿，部分为算法找到的近似前沿，适用于调度优化研究。