Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?

Fernando Garza-Santisteban, Jorge Mario Cruz-Duarte (), Ivan Amaya, José Carlos Ortiz-Bayliss, Santiago Enrique Conant-Pablos and Hugo Terashima-Marín
Additional contact information
Fernando Garza-Santisteban: Tecnologico de Monterrey
Jorge Mario Cruz-Duarte: Tecnologico de Monterrey
Ivan Amaya: Tecnologico de Monterrey
José Carlos Ortiz-Bayliss: Tecnologico de Monterrey
Santiago Enrique Conant-Pablos: Tecnologico de Monterrey
Hugo Terashima-Marín: Tecnologico de Monterrey

Journal of Scheduling, 2025, vol. 28, issue 1, No 3, 85-99

Abstract: Abstract Selection hyper-heuristics are novel tools that combine low-level heuristics into robust solvers commonly used for tackling combinatorial optimization problems. However, the training cost is a drawback that hinders their applicability. In this work, we analyze the effect of training with different problem sizes to determine whether an effective simplification can be made. We select Job Shop Scheduling problems as an illustrative scenario to analyze and propose two hyper-heuristic approaches, based on Simulated Annealing (SA) and Unified Particle Swarm Optimization (UPSO), which use a defined set of simple priority dispatching rules as heuristics. Preliminary results suggest a relationship between instance size and hyper-heuristic performance. We conduct experiments training on two different instance sizes to understand such a relationship better. Our data show that hyper-heuristics trained in small-sized instances perform similarly to those trained in larger ones. However, the extent of such an effect changes depending on the approach followed. This effect was more substantial for the model powered by SA, and the resulting behavior for small and large-sized instances was very similar. Conversely, for the model powered by UPSO, data were more outspread. Even so, the phenomenon was noticeable as the median performance was similar between small and large-sized instances. In fact, through UPSO, we achieved hyper-heuristics that performed better on the training set. However, using small-sized instances seems to overspecialize, which results in spread-out testing performance. Hyper-heuristics resulting from training with small-sized instances can outperform a synthetic Oracle on large-sized testing instances in about 50% of the runs for SA and 25% for UPSO. This allows for significant time savings during the training procedure, thus representing a worthy approach.

Keywords: Job shop scheduling; Hyper-heuristic; Simulated annealing; Unified particle swarm optimization; Instance size (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-024-00819-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:28:y:2025:i:1:d:10.1007_s10951-024-00819-8

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-024-00819-8

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().