A memetic algorithm for solving flexible Job-Shop Scheduling Problems

Wenping Ma, Yi Zuo, Jiulin Zeng, Shuang Liang, Licheng Jiao

Abstract: The flexible Job-shop Scheduling Problem (FJSP) is an extension of the classical job-shop scheduling problem (JSP). In this paper, a memetic algorithm (MA) for the FJSP is presented. This MA is a hybrid genetic algorithm which explores the search space and two efficient local searchers to exploit information in the search region. An extensive computational study on 49 benchmark problems shows that the algorithm is effective and robust, with respect to other well-known effective algorithms.