Robotic flow shop scheduling with parallel machines and no-wait constraints in an aluminium anodising plant with the CMAES algorithm

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a covariance matrix adaptation evolution strategy (CMAES) based algorithm for a robotic flow shop scheduling problem with multiple robots and parallel machines. The algorithm is compared to three popular scheduling rules as well as existing schedules at a South African anodising plant. The CMAES algorithm statistically significantly outperformed all other algorithms for the size of problems currently scheduled by the anodising plant. A sensitivity analysis was also conducted on the number of tanks required at critical stages in the process to determine the effectiveness of the CMAES algorithm in assisting the anodising plant to make business decisions.

Cite

CITATION STYLE

APA

Behr, C. M., & Grobler, J. (2018). Robotic flow shop scheduling with parallel machines and no-wait constraints in an aluminium anodising plant with the CMAES algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10841 LNAI, pp. 302–312). Springer Verlag. https://doi.org/10.1007/978-3-319-91253-0_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free