Dataset Groups Activity Stream 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. BibTex: @dataset{Imanol_Echeverria_and_Maialen_Murua_and_Roberto_Santana_2024, abstract = {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.}, author = {Imanol Echeverria and Maialen Murua and Roberto Santana}, doi = {10.57702/2y5kpkdq}, institution = {No Organization}, keyword = {'Combinatorial Optimization', 'Flexible Job-Shop Scheduling', 'Scheduling'}, month = {dec}, publisher = {TIB}, title = {Flexible Job-Shop Scheduling Problem}, url = {https://service.tib.eu/ldmservice/dataset/flexible-job-shop-scheduling-problem}, year = {2024} }