A generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP)

Abstract

This paper presents a novel algorithm to solve the multi-project scheduling problem with resource constraints (RCMPSP). The algorithm was tested with all the problems proposed in the multi-project scheduling problem library, which is the main reference to benchmark RCMPSP algorithms. Our analysis of the results demonstrates that this algorithm, in spite of its simplicity, outperforms other algorithms published in the library in 16% of the cases and holds the best result in 27% of the cases. These results, along with the fact that this is a general-purpose algorithm, make it a good choice to deal with limited time and resources in portfolio management.