Chemical reaction optimization metaheuristic with greedy algorithm for flexible job shop scheduling problem

In the manufacturing systems, The scheduling problem consists in assigning operations on a set of available resources in order to achieve defined objectives. The Flexible Job shop Scheduling Problem (FJSP) is an extension of classical Job shop Scheduling Problem (JSP) such that each operation can be processed on different machine and its processing time depends on the used machine. This paper proposes a model named Chemical Reaction Optimization with Greedy algorithm (CROG-FJSP) to solve the FJSP in order to minimize the maximum completion time (Makespan). Experiments are performed on benchmark instances proposed in the literature to evaluate the performance of our model.