A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{Hart:2016:EC,

• author = "Emma Hart and Kevin Sim",
• journal = "Evolutionary Computation",
• title = "A Hyper-Heuristic Ensemble Method for Static Job-Shop Scheduling",
• year = "2016",
• volume = "24",
• number = "4",
• pages = "609--635",
• abstract = "We describe a new hyper-heuristic method NELLI-GP for solving job-shop scheduling problems (JSSP) that evolves an ensemble of heuristics. The ensemble adopts a divide-and-conquer approach in which each heuristic solves a unique subset of the instance set considered. NELLI-GP extends an existing ensemble method called NELLI by introducing a novel heuristic generator that evolves heuristics composed of linear sequences of dispatching rules: each rule is represented using a tree structure and is itself evolved. Following a training period, the ensemble is shown to outperform both existing dispatching rules and a standard genetic programming algorithm on a large set of new test instances. In addition, it obtains superior results on a set of 210 benchmark problems from the literature when compared to two state-of-the-art hyper-heuristic approaches. Further analysis of the relationship between heuristics in the evolved ensemble and the instances each solves provides new insights into features that might describe similar instances.",
• keywords = "genetic algorithms, genetic programming, Job-shop-scheduling, dispatching rule, genetic programming., heuristic ensemble, hyper-heuristic",
• DOI = "doi:10.1162/EVCO_a_00183",
• ISSN = "1063-6560",
• month = dec,
• notes = "Also known as \cite{7765317}",

}

Genetic Programming entries for Emma Hart Kevin Sim

Citations