Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches

This paper deals with a problem of partial flexible job shop with the objective of minimising makespan and minimising total operation costs. This problem is a kind of flexible job shop problem that is known to be NP-hard. Hence four multi-objective, Pareto-based, meta-heuristic optimisation methods, namely non-dominated sorting genetic algorithm (NSGA-II), non-dominated ranked genetic algorithm (NRGA), multiobjective genetic algorithm (MOGA) and Pareto archive evolutionary strategy (PAES) are proposed to solve the problem with the aim of finding approximations of optimal Pareto front. A new solution representation is introduced with the aim of solving the addressed problem. For the purpose of performance evaluation of our proposed algorithms, we generate some instances and use some benchmarks which have been applied in the literature. Also a comprehensive computational and statistical analysis is conducted in order to analyse the performance of the applied algorithms in five metrics including non-dominated solution, diversification, mean ideal distance, quality metric and data envelopment analysis are presented. Data envelopment analysis is a well-known method for efficiently evaluating the effectiveness of multi-criteria decision making. In this study we proposed this method of assessment of the non-dominated solutions. The results indicate that in general NRGA and PAES have had a better performance in comparison with the other two algorithms.