Creating dispatching rules by simple ensemble combination

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

@Article{Durasevic2019,

• author = "Marko Durasevic and Domagoj Jakobovic",
• title = "Creating dispatching rules by simple ensemble combination",
• journal = "Journal of Heuristics",
• year = "2019",
• volume = "25",
• number = "6",
• pages = "959--1013",
• month = dec,
• keywords = "genetic algorithms, genetic programming, Dispatching rules, Unrelated machines environment, Ensemble learning, Scheduling",
• ISSN = "1572-9397",
• URL = "https://doi.org/10.1007/s10732-019-09416-x",
• DOI = "doi:10.1007/s10732-019-09416-x",
• size = "55 pages",
• abstract = "Dispatching rules are often the method of choice for solving scheduling problems since they are fast, simple, and adaptive approaches. In recent years genetic programming has increasingly been used to automatically create dispatching rules for various scheduling problems. Since genetic programming is a stochastic approach, it needs to be executed several times to ascertain that good dispatching rules were obtained. This paper analyses whether combining several dispatching rules into an ensemble leads to performance improvements over the individual dispatching rules. Two methods for creating ensembles of dispatching rules, based on the sum and vote methods applied in machine learning, are used and their effectiveness is analysed with regards to the size of the ensemble, the genetic programming method used to generate the dispatching rules, the size of the evolved dispatching rules, and the method used for creating the ensembles. The results demonstrate that the generated ensembles achieve significant improvements over individual automatically generated dispatching rules.",

}

Genetic Programming entries for Marko Durasevic Domagoj Jakobovic

Citations