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

Published: 24-10-2018| Version 1 | DOI: 10.17632/cb34wwptj7.1
Contributor:
Carlos Soto

Description

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.

Files

Steps to reproduce

The data was obtained by a parallel branch-and-bound with shared memory. A total of 24 threads were used with a time limit of 120 hours.