An enhanced GRASP algotithm for the unrelated parallel machines problem with additional resources
M. Villaizán Vallelado, J. C. Yepes Borrero, M. López-García, J. Alcaraz
Efficient scheduling tools are vital for production environments where machine availability and resource constraints are critical.
This paper addresses the Unrelated Parallel Machine Scheduling problem with setup times and additional Resources in setups (UPMSR-S), a model for real-world production where setups require limited resources like personnel or equipment. By integrating adaptive strategies, it tackles the complexity of combinatorial optimization.
The algorithm outperforms previous methods on 1000 benchmark instances, with Relative Percentage Deviation improvements exceeding 70% in several cases.
This solution excels in environments with high job and machine counts, addressing complex scheduling scenarios with setup constraints.
Statistical analysis confirms its effectiveness across various instance sizes and complexities, particularly as jobs and machines increase, making it highly applicable to advanced production systems.
Keywords: Metaheuristics, Machining processes, Scheduling problem, GRASP, Unrelated Parallel Machine, Additional resources
Scheduled
Heuristics and Metaheuristics
September 2, 2026 12:40 PM
Aula 21
Other papers in the same session
F. Huguet, L. M. Plà-Aragonés, V. Albornoz, M. Pohl
I. Méndez Fernández, A. García Hernández-Díaz, R. Gordaliza Ruiz, S. Pérez Peló, J. Sánchez-Oro Calvo
P. Terán Viadero, M. A. Carravilla, J. F. Oliveira, F. J. Martín Campo, A. Alonso Ayuso