Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms

In this paper we consider the Multi-Mode Resource-Constrained Project Problem with makespan minimisation as the objective. We have developed new genetic algorithms, extending the representation and operators previously designed for the single-mode version of the problem. Moreover, we have defined a new fitness function for the individuals who are infeasible. We have tested different variants of the algorithm and chosen the best to be compared to different heuristics previously published, using standard sets of instances included in PSPLIB. Results illustrated the good performance of our algorithm.