An Efficient Multi-Objective Algorithm for Resource Constrained Project Scheduling Problem
Abstract
This paper presents a modified multiobjective algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). In this problem, a set of activities have to be scheduling considering precedence and limited resources. In this study, the two objectives are the minimization of both the maximum completion time and the total weighted start times. A modified non dominated sorting genetic algorithm (NSGA2) is proposed. Benchmark instances were tested and the results show improvements with respect to original version of the algorithm.