Abstract: The Flexible Job Shop Scheduling Problem (FJSP), a classical NP-hard problem, requires the solution of two aspects of the complex problem, the first is to assign each operation to an ...