2026-04-30T05:18:32Zhttps://uvadoc.uva.es/oai/request

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

00925njm 22002777a 4500 dc Villafáñez Cardeñoso, Félix Antonio author Poza Garcia, David Jesús author López Paredes, Adolfo author Pajares Gutiérrez, Javier author del Olmo, Ricardo author 2019 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. 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) A generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP)