Abstract
We consider simple multi-start evolutionary algorithms applied to the classical NP-hard combinatorial optimization problem of Makespan Scheduling on two machines. We study the dependence of the runtime of this type of algorithm on three different key hardness parameters. By doing this, we provide further structural insights into the behavior of evolutionary algorithms for this classical problem. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Sutton, A. M., & Neumann, F. (2012). A parameterized runtime analysis of simple evolutionary algorithms for makespan scheduling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7491 LNCS, pp. 52–61). https://doi.org/10.1007/978-3-642-32937-1_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
