Research Output
Optimisation Algorithms for Parallel Machine Scheduling Problems with Setup Times
  Parallel 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.

  • Date:

    07 July 2021

  • Publication Status:

    Published

  • Publisher

    Association for Computing Machinery (ACM)

  • DOI:

    10.1145/3449726.3459487

  • Funders:

    Edinburgh Napier Funded

Citation

Kittel, F., Enekel, J., Guckert, M., Holznigenkemper, J., & Urquhart, N. (2021). Optimisation Algorithms for Parallel Machine Scheduling Problems with Setup Times. In GECCO '21: Proceedings of the Genetic and Evolutionary Computation Conference Companion (131-132). https://doi.org/10.1145/3449726.3459487

Authors

Keywords

Best Response Dynamics, Parallel Machine Scheduling with Setup Times, Heuristics

Monthly Views:

Available Documents