Bredael, DriesVanhoucke, Mario2024-03-132024-03-1320240377-221710.1016/j.ejor.2023.11.009http://hdl.handle.net/20.500.12127/7402A novel metaheuristic solution procedure for the RCMPSP is presented. Two variants of resource-buffered scheduling are embedded within the procedure. The algorithm is benchmarked against 10 existing metaheuristic algorithms. New best-known solutions are generated for 20% of the instances in the dataset. A new schedule metric is proposed to analyse the structure of the solutions.In this study, we compose a new metaheuristic algorithm for solving the resource-constrained multi-project scheduling problem. Our approach is based on a general metaheuristic strategy which incorporates two resource-buffered scheduling tactics. We build on the most effective evolutionary operators and other well-known scheduling methods to create a novel genetic algorithm with resource buffers. We test our algorithm on a large benchmark dataset and compare its performance to ten existing metaheuristic algorithms. Our results show that our algorithm can generate new best-known solutions for about 20% of the test instances, depending on the optimisation criterion and due date. In some cases, our algorithm outperforms all other available methods combined. Finally, we introduce a new schedule metric that can quantitatively measure the dominant structure of a solution, and use it to analyse the differences between the best solutions for different objectives, due dates, and instance parameters.enProject SchedulingGenetic AlgorithmsMetaheuristicsMulti-ProjectEuropean Journal of Operational Research1872-686058614