A NSGA-II and NSGA-III comparison for solving an open shop scheduling problem with resource constraints

Abstract This paper presents an open shop scheduling problem based on a real mechanical workshop made of m machines that process n jobs. It deals with different resource constraints related to the tools allocation and the multi-skills staff assignment. Resource skills and their availability are required to execute one process task. In this work, we expose a multi-objective problem where the idea is to minimize three objectives simultaneously. The first one considers the minimization of the total flow time of jobs in the production system, then the workload balancing concerning both, humans and machines is addressed. We propose and compare two multi-objective methods: NSGA-II and NSGA-III. Computational experiments are designed according to the literature, we expose the small and large sized instances to present the general performance of these algorithms using the hyper-volume metric to compare them.

[1]  J. Dennis,et al.  A closer look at drawbacks of minimizing weighted sums of objectives for Pareto set generation in multicriteria optimization problems , 1997 .

[2]  Farouk Yalaoui,et al.  A fuzzy ant colony optimization to solve an open shop scheduling problem with multi-skills resource constraints , 2015 .

[3]  Kalyanmoy Deb,et al.  MULTI-OBJECTIVE FUNCTION OPTIMIZATION USING NON-DOMINATED SORTING GENETIC ALGORITHMS , 1994 .

[4]  Luigi Barone,et al.  An evolution strategy with probabilistic mutation for multi-objective optimisation , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[5]  M. A. Abido,et al.  A niched Pareto genetic algorithm for multiobjective environmental/economic dispatch , 2003 .

[6]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[7]  Kalyanmoy Deb,et al.  An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.

[8]  Kalyanmoy Deb,et al.  Muiltiobjective Optimization Using Nondominated Sorting in Genetic Algorithms , 1994, Evolutionary Computation.

[9]  R. Lyndon While,et al.  A faster algorithm for calculating hypervolume , 2006, IEEE Transactions on Evolutionary Computation.

[10]  Peter J. Fleming,et al.  Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization , 1993, ICGA.

[11]  Eckart Zitzler,et al.  Evolutionary multi-objective optimization , 2007, Eur. J. Oper. Res..

[12]  Hisao Ishibuchi,et al.  An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization , 2008, Eur. J. Oper. Res..

[13]  Liang Gao,et al.  A Survey and Future Trend of Study on Multi-Objective Scheduling , 2008, 2008 Fourth International Conference on Natural Computation.