RT info:eu-repo/semantics/article
T1 A generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP)
A1 Villafáñez Cardeñoso, Félix Antonio
A1 Poza Garcia, David Jesús
A1 López Paredes, Adolfo
A1 Pajares Gutiérrez, Javier
A1 del Olmo, Ricardo
K1 Project management
K1 Project scheduling
K1 Portfolio management
K1 Multi-project scheduling
K1 RCMPSP
K1 MPSPLib
AB 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.
PB Springer Berlin Heidelberg
YR 2019
FD 2019
LK https://uvadoc.uva.es/handle/10324/65286
UL https://uvadoc.uva.es/handle/10324/65286
LA eng
NO Soft Computing, 23(10), 3465-3479
NO Producción Científica
DS UVaDOC
RD 22-dic-2024