A path-relinking metaheuristic for the resource levelling problem

Abstract

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.

Keywords:

• project scheduling
• resource levelling problem
• path-relinking

Acknowledgements

This work was supported in part by Ferdowsi University of Mashhad's Research Council, under grant #18203 (dated 28-6-2011).