Por favor, use este identificador para citar o enlazar este ítem: https://hdl.handle.net/11000/34255
Registro completo de metadatos
Campo DC Valor Lengua/Idioma
dc.contributor.authorAnton-Sanchez, Laura-
dc.contributor.authorRodríguez-Ballesteros, Sofía-
dc.contributor.authorALCARAZ, JAVIER-
dc.contributor.otherDepartamentos de la UMH::Estadística, Matemáticas e Informáticaes_ES
dc.date.accessioned2025-01-10T08:54:28Z-
dc.date.available2025-01-10T08:54:28Z-
dc.date.created2024-
dc.identifier.citationComputers and Operations Researches_ES
dc.identifier.issn1873-765X-
dc.identifier.issn0305-0548-
dc.identifier.urihttps://hdl.handle.net/11000/34255-
dc.description.abstractThe bi-objective resource-constrained project scheduling problem with time-dependent resource costs was recently introduced and consists of scheduling a set of activities subject to precedence and resource constraints, minimizing the makespan and the total cost for resource usage. Precisely, costs are determined by the resource being considered together with the time it is used. Although this generalization of the traditional resourceconstrained project scheduling problem is rather recent, it has garnered substantial interest as it succeeds in meeting a wide range of real-world demands. In such a multi-objective context, solving the aforementioned problem poses a challenge, as both objectives conflict with each other, giving rise to a set of trade-off optimal solutions, commonly known as the Pareto front (PF). Given that many medium or large-sized instances of this problem cannot be solved by exact methods, the development of metaheuristics to find the PF is necessary. So far, only one metaheuristic had been developed to solve this problem. In this work we have implemented six additional multi-objective evolutionary algorithms (MOEAs), representing different paradigms, and subsequently, an exhaustive comparison of their performance has been carried out. In particular, all the compared MOEAs share the same encoding and main operators, focusing the comparison on the general algorithm framework rather than specific versions. Metaheuristic algorithms typically yield an approximation of the optimal PF, prompting the question of how to assess the quality of the obtained approximations. To this end, a computational and statistically supported study is conducted, choosing a benchmark of bicriteria resource-constrained project scheduling problems and applying a set of performance measures to the solution sets obtained by each methodology. The results show that there are significant differences among the performance of the metaheuristics evaluated.es_ES
dc.formatapplication/pdfes_ES
dc.format.extent19es_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.relation.ispartofseries163es_ES
dc.rightsinfo:eu-repo/semantics/openAccesses_ES
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectMetaheuristices_ES
dc.subjectResource-constrained project scheduling problemes_ES
dc.subjectMulti-objective optimizationes_ES
dc.subjectPareto frontes_ES
dc.subjectPerformance indicatores_ES
dc.subject.otherCDU::5 - Ciencias puras y naturales::51 - Matemáticases_ES
dc.titleMetaheuristics for the bi-objective resource-constrained project scheduling problem with time-dependent resource costs: An experimental comparisones_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.relation.publisherversionhttps://doi.org/10.1016/j.cor.2023.106489es_ES
Aparece en las colecciones:
Artículos Estadística, Matemáticas e Informática


Vista previa

Ver/Abrir:
 2024 Rodríguez-Ballesteros-et-al-C&OR.pdf

2,86 MB
Adobe PDF
Compartir:


Creative Commons La licencia se describe como: Atribución-NonComercial-NoDerivada 4.0 Internacional.