A Comparative Study of Multi-objective Flexible Job-shop Scheduling Problem

Flexible job shop scheduling problem (FJSP) has always been a pivotal research content in the manufacture field. However, many studies only focus on the maximum completion time. The growing demand for development urgently needs a FJSP that can cover a variety of optimization goals. As a result, a multi-objective FJSP model is proposed, which includes four optimization objectives: maximum completion time, total energy depletion, delay time and total machine load. For the multi-objective FJSP, three optimization algorithms of NSGA-II, NSGA-III and MOEA/D are used to minimize the maximum completion time, total energy depletion, delay time and total machine load. The superiority and validity of these algorithms are verified by tests.