2026-04-14T19:50:50Zhttps://uvadoc.uva.es/oai/request

oai:uvadoc.uva.es:10324/652862025-03-26T19:10:03Zcom_10324_1180com_10324_931com_10324_894col_10324_1375

Villafáñez Cardeñoso, Félix Antonio Poza Garcia, David Jesús López Paredes, Adolfo Pajares Gutiérrez, Javier del Olmo, Ricardo 2024-01-30T10:39:54Z 2024-01-30T10:39:54Z 2019 Soft Computing, 23(10), 3465-3479 https://uvadoc.uva.es/handle/10324/65286 10.1016/j.ijproman.2015.06.012 3465 3479 A generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP) Producción Científica 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. This research has been partially financed by the project ABARNET (Agent-Based Algorithms for Railway NETworks optimization) financed by the Spanish Ministry of Economy, Industry and Competitiveness, with Grant DPI2016-78902-P, and the Computational Models for Industrial Management (CM4IM) project, funded by the Valladolid University General Foundation. application/pdf eng Springer Berlin Heidelberg info:eu-repo/semantics/restrictedAccess Project management Project scheduling Portfolio management Multi-project scheduling RCMPSP MPSPLib A generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP) info:eu-repo/semantics/article info:eu-repo/semantics/submittedVersion https://link.springer.com/article/10.1007/s00500-017-3003-y SI