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.

搜集汇总

背景与挑战

背景概述

该数据集提供了柔性作业车间调度问题的帕累托前沿，基于Fattahi基准测试，通过并行分支定界算法（使用24个线程，120小时时间限制）计算生成。优化目标包括完工时间、最大工作负载和总工作负载，覆盖实例从SFJS1到SFJS10以及MSFJ1到MFJS2，适用于多目标优化和调度研究。