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: