Multi-project scheduling: A benchmark analysis of metaheuristic algorithms on various optimisation criteria and due dates

This paper reviews a set of ten existing metaheuristic solution procedures for the resource-constrained multi-project scheduling problem. Algorithmic implementations are constructed based on the description of the original procedures in literature. Equivalence is verified on the original test instances for the orig-inal objective and parameters through a comparison with the reported results. An extensive benchmark analysis is performed on a novel, publicly available dataset for a variety of optimisation criteria and due date settings for which the original algorithms have not been tested earlier. The impact of the different objectives, due dates and test instance parameters is analysed and an overall ranking of the metaheuristic solution methods for different situations is discussed. Key insights into the structure of competitive solu-tions for disparate objectives and due date settings are presented and effective algorithmic components are revealed. (c) 2022 Elsevier B.V. All rights reserved.

Automated summary

This paper provides a review of ten existing metaheuristic solution procedures for the resource-constrained multi-project scheduling problem. Algorithmic implementations are constructed and verified on original test instances. An extensive benchmark analysis is performed on a novel dataset, resulting in an overall ranking of the metaheuristic solution methods and key insights into competitive solutions.