Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities

Producción Científica

Detalhes bibliográficos
Autores: Yepes Borrero, Juan Camilo, Alcaraz, Javier, López García, Marta, Villaizán Vallelado, Mario
Tipo de documento: artigo
Estado:Versão publicada
Data de publicação:2026
País:España
Recursos:Universidad de Valladolid
Repositório:UVaDOC. Repositorio Documental de la Universidad de Valladolid
OAI Identifier:oai:uvadoc.uva.es:10324/82300
Acesso em linha:https://doi.org/10.1007/s10479-026-07065-5
https://uvadoc.uva.es/handle/10324/82300
Access Level:Acceso aberto
Palavra-chave:GRASP (Greedy Randomised Adaptive Search Procedure)
Metaheurística
Algoritmos
1203.02 Lenguajes Algorítmicos
1209 Estadística
id ES_5be3da8e437c8e660ea90303493d8703
oai_identifier_str oai:uvadoc.uva.es:10324/82300
network_acronym_str ES
network_name_str España
repository_id_str
spelling Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilitiesYepes Borrero, Juan CamiloAlcaraz, JavierLópez García, MartaVillaizán Vallelado, MarioGRASP (Greedy Randomised Adaptive Search Procedure)MetaheurísticaAlgoritmos1203.02 Lenguajes Algorítmicos1209 EstadísticaProducción CientíficaEfficient scheduling tools are essential for managing production environments where both machine availability and additional resource constraints play a significant role. This paper addresses the Unrelated Parallel Machine scheduling problem with setup times and additional resources in the Setups (UPMSR-S), an NP-hard problem that models real-world production settings where setups require limited resources, such as personnel or specialized equipment. We propose an enhanced algorithm designed to better handle resource-related infeasibilities and consistently outperform state-of-the-art methods. This is demonstrated through an extensive computational campaign on 1,000 benchmark instances, with improvements in Relative Percentage Deviation (RPD) exceeding 70% for several instance sizes. The proposed approach is well suited to large production environments involving setup and resource constraints, showing strong performance in challenging scheduling settings. Statistical analysis confirms that the method is highly effective across a wide range of instance sizes and scenarios, with particularly strong performance as the number of jobs and machines increases.Ministerio de Ciencia e Innovación de España en el marco del proyecto «OPRES-Optimización realista en problemas de salud pública» (n.º PID2021-124975OB-I00)Junta de Castilla y León en el marco de Research and Innovation Strategy for Smart Specialization (RIS3) de Castilla y León 2021-2027.Universidades (MICIU) / AEI (Agencia Estatal de Investigación), PID2022-136383NB-I00, y CIPROM/2024/34, Conselleria de Educación, Cultura, Universidades y Empleo, Generalitat ValencianaEuropean Union’s Horizon Europe research and innovation actions under grant agreement No. 101168560 (CoEvolution)Springer2026info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://doi.org/10.1007/s10479-026-07065-5https://uvadoc.uva.es/handle/10324/82300reponame:UVaDOC. Repositorio Documental de la Universidad de Valladolidinstname:Universidad de ValladolidIngléshttps://link.springer.com/article/10.1007/s10479-026-07065-5info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/4.0/oai:uvadoc.uva.es:10324/823002026-06-13T12:44:47Z
dc.title.none.fl_str_mv Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
title Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
spellingShingle Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
Yepes Borrero, Juan Camilo
GRASP (Greedy Randomised Adaptive Search Procedure)
Metaheurística
Algoritmos
1203.02 Lenguajes Algorítmicos
1209 Estadística
title_short Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
title_full Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
title_fullStr Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
title_full_unstemmed Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
title_sort Unrelated parallel machine scheduling problem with setup times and additional resources: an enhanced metaheuristic to address resource-related infeasibilities
dc.creator.none.fl_str_mv Yepes Borrero, Juan Camilo
Alcaraz, Javier
López García, Marta
Villaizán Vallelado, Mario
author Yepes Borrero, Juan Camilo
author_facet Yepes Borrero, Juan Camilo
Alcaraz, Javier
López García, Marta
Villaizán Vallelado, Mario
author_role author
author2 Alcaraz, Javier
López García, Marta
Villaizán Vallelado, Mario
author2_role author
author
author
dc.subject.none.fl_str_mv GRASP (Greedy Randomised Adaptive Search Procedure)
Metaheurística
Algoritmos
1203.02 Lenguajes Algorítmicos
1209 Estadística
topic GRASP (Greedy Randomised Adaptive Search Procedure)
Metaheurística
Algoritmos
1203.02 Lenguajes Algorítmicos
1209 Estadística
description Producción Científica
publishDate 2026
dc.date.none.fl_str_mv 2026
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv https://doi.org/10.1007/s10479-026-07065-5
https://uvadoc.uva.es/handle/10324/82300
url https://doi.org/10.1007/s10479-026-07065-5
https://uvadoc.uva.es/handle/10324/82300
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv https://link.springer.com/article/10.1007/s10479-026-07065-5
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/4.0/
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
dc.source.none.fl_str_mv reponame:UVaDOC. Repositorio Documental de la Universidad de Valladolid
instname:Universidad de Valladolid
instname_str Universidad de Valladolid
reponame_str UVaDOC. Repositorio Documental de la Universidad de Valladolid
collection UVaDOC. Repositorio Documental de la Universidad de Valladolid
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869408847796371456
score 15,812455

Registros relacionados