A path‐relinking metaheuristic for the resource levelling problem

This paper deals with project scheduling problem with resource levelling objective function where precedence relations among activities are prescribed. We develop a dedicated path‐relinking metaheuristic algorithm to tackle this problem. Computational results on randomly generated test sets indicate the developed procedure is efficient and outperforms the best available metaheuristic algorithms in the literature.