Flexible Job-Shop Scheduling Problem

The Flexible Job-Shop Scheduling Problem (FJSSP) is a combinatorial optimization problem where the goal is to find the optimal schedule for a set of jobs on a set of machines.

Data and Resources

Cite this as

Imanol Echeverria, Maialen Murua, Roberto Santana (2024). Dataset: Flexible Job-Shop Scheduling Problem. https://doi.org/10.57702/2y5kpkdq

DOI retrieved: December 3, 2024

Additional Info

Field Value
Created December 3, 2024
Last update December 3, 2024
Defined In https://doi.org/10.48550/arXiv.2403.09249
Author Imanol Echeverria
More Authors
Maialen Murua
Roberto Santana