Selected variants of a Memetic Algorithm for JSP – a comparative study

Abstract

The article aims to address a research gap concerning the adequate configuration of a Memetic Algorithm adapted to solve the Job-Shop Scheduling Problem. The goal was accomplished by means of conducting a comparative study of 16 variants of a Memetic Algorithm, characterised with different places of hybridisation and local search methods applied. The study involved the solution of eleven instances of JSP and the comparison of the results with the results achieved with an Evolutionary Algorithm lacking the mechanism of hybridisation and selected local search methods. The utilitarian significance of the problem also involved the use of assessment measures intended for both practical applications and research purposes.

Keywords:

• Memetic Algorithm
• optimisation
• metaheuristics
• job-shop scheduling
• job shop

Disclosure statement

No potential conflict of interest was reported by the authors.