Performance Comparison of NSGA-II and NSGA-III on Bi-objective Job Shop Scheduling Problems

Job Shop Scheduling (JSS) problems emerge in many industrial sectors, where it is sought to maximize efficiency, minimize costs, minimize energy consumption among other conflicting objectives. Thus, these optimization problems involve two or more objectives. In recent years, new algorithms have been developed and proposed to tackle multi-objective problems such as the Non-dominated Sorting Genetic Algorithm II (NSGA-II) and the Non-dominated Sorting Genetic Algorithm III (NSGA-III), among others. The main goal of this work is to compare the performance of these algorithms on solving bi-objective JSS problems on unrelated parallel machines with sequence-dependent setup times. For comparison purposes, the results of the hypervolume performance measure are statistically analysed. The results obtained show that the performance of these two algorithms is not significantly different and, therefore, NSGA-III does not represent a clear advantage on solving bi-objective JSS problems.