Name
Abstract | ||
|---|---|---|
ABSTRACTParallel machine scheduling is a problem of high practical relevance for the manufacturing industry. In this paper, we address a variant in which an unweighted combination of earliness, tardiness and setup times aggregated in a single objective function is minimised. We compare an Evolutionary Algorithm (EA) approach with a variant of local search implementing a probabilistic Best Response Dynamic algorithm (p-BRD) inspired by game theoretic considerations. Our p-BRD algorithm achieved promising results outperforming the EA on a series of test sets. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3449726.3459487 | Genetic and Evolutionary Computation Conference |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabian Kittel | 1 | 0 | 0.34 |
| Jannik Enenkel | 2 | 0 | 0.34 |
| Michael Guckert | 3 | 0 | 0.68 |
| Jana Holznigenkemper | 4 | 0 | 0.34 |
| neil b urquhart | 5 | 83 | 14.70 |