Hyper-heuristics have emerged as a way to raise the level of generality of search techniques
for computational search problems. This is in contrast to many approaches, which represent …

Hyper-heuristics are search techniques for selecting, generating, and sequencing (meta)-
heuristics to solve challenging optimization problems. They differ from traditional (meta) …

Dynamic flexible job shop scheduling (JSS) is an important combinatorial optimization
problem with complex routing and sequencing decisions under dynamic environments …

Dynamic flexible job-shop scheduling (DFJSS) is a challenging combinational optimization
problem that takes the dynamic environment into account. Genetic programming …

Abstract Three-Dimensional Packing Problems (3D-PPs) can be applied to effectively
reduce logistics costs in various areas, such as airline cargo management and warehouse …

Hyper-heuristics comprise a set of approaches that aim to automate the development of
computational search methodologies. This chapter overviews previous categorisations of …

Genetic programming has been a powerful technique for automated design of production
scheduling heuristics. Many studies have shown that heuristics evolved by genetic …

Hyper-heuristics comprise a set of approaches that are motivated (at least in part) by the
goal of automating the design of heuristic methods to solve hard computational search …

An efficient manufacturing system is key to maintaining a healthy economy today. With the
rapid development of science and technology and the progress of human society, the …

Evolutionary multitask learning has achieved great success due to its ability to handle
multiple tasks simultaneously. However, it is rarely used in the hyperheuristic domain, which …