Mostrar el registro sencillo del ítem

dc.contributor.authorVillafáñez Cardeñoso, Félix Antonio 
dc.contributor.authorPoza Garcia, David Jesús 
dc.contributor.authorLópez Paredes, Adolfo 
dc.contributor.authorPajares Gutiérrez, Javier 
dc.contributor.authordel Olmo, Ricardo
dc.date.accessioned2024-01-30T10:39:54Z
dc.date.available2024-01-30T10:39:54Z
dc.date.issued2019
dc.identifier.citationSoft Computing, 23(10), 3465-3479es
dc.identifier.urihttps://uvadoc.uva.es/handle/10324/65286
dc.descriptionProducción Científicaes
dc.description.abstractThis 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.es
dc.format.mimetypeapplication/pdfes
dc.language.isoenges
dc.publisherSpringer Berlin Heidelberges
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccesses
dc.subject.classificationProject managementes
dc.subject.classificationProject schedulinges
dc.subject.classificationPortfolio managementes
dc.subject.classificationMulti-project schedulinges
dc.subject.classificationRCMPSPes
dc.subject.classificationMPSPLibes
dc.titleA generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP)es
dc.typeinfo:eu-repo/semantics/articlees
dc.identifier.doihttps://doi.org/10.1016/j.ijproman.2015.06.012es
dc.relation.publisherversionhttps://link.springer.com/article/10.1007/s00500-017-3003-yes
dc.identifier.publicationfirstpage3465es
dc.identifier.publicationlastpage3479es
dc.identifier.publicationtitleA generic heuristic for multi-project scheduling problems with global and local resource constraints (RCMPSP)es
dc.peerreviewedSIes
dc.description.projectThis 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.es
dc.type.hasVersioninfo:eu-repo/semantics/submittedVersiones


Ficheros en el ítem

Thumbnail

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem