Non-dominated Sorting Genetic Algorithms for a Multi-objective Resource Constraint Project Scheduling Problem

• Published in: International journal of intelligent systems Vol. 28; no. 5; pp. 791 - 806
• Main Authors: Wang, Xixi, Yalaoui, Farouk, Dugardin, Frédéric
• Format: Journal Article
• Language: English
• Published: Wiley 25-09-2019; De Gruyter
• Subjects: 90b35; 90b50; Computer Science; lorenz dominance; multi-objective; non-dominated sorting genetic algorithm; Operations Research; resource constraint; scheduling problem; resource constraint; non-dominated sorting genetic algorithm; scheduling problem; Multi-objective; Lorenz dominance
• ISSN: 0884-8173; 0334-1860; 1098-111X; 2191-026X
• DOI: 10.1515/jisys-2017-0241

The resource constraint project scheduling problem (RCPSP) has attracted growing attention since the last decades. Precedence constraints are considered as well as resources with limited capacities. During the project, the same resource can be required by several in-process jobs and it is compulsory to ensure that the consumptions do not exceed the limited capacities. In this paper, several criteria are involved, namely makespan, total job tardiness, and workload balancing level. Our problem is firstly solved by the non-dominated sorting genetic algorithm-II (NSGAII) as well as the recently proposed NSGAIII. Giving emphasis to the selection procedure, we apply both the traditional Pareto dominance and the less documented Lorenz dominance into the niching mechanism of NSGAIII. Hence, we adopt and modify L-NSGAII to our problem and propose L-NSGAIII by integrating the notion of Lorenz dominance. Our methods are tested by 1350 randomly generated instances, considering problems with 30–150 jobs and different configurations of resources and due dates. Hypervolume and C-metric are considered to evaluate the results. The Lorenz dominance leads the population more toward the ideal point. As experiments show, it allows improving the original NSGA approach.