A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime

作者：

Highlights：

• We study a distributed flowshop with preventive maintenance to minimize total flowtime.

• We present a mathematical model for this problem.

• A memetic algorithm is improved with a hash map based population.

• A hybrid local search is well designed.

• Experimental results demonstrate the effectiveness of the proposed algorithm.

摘要

•We study a distributed flowshop with preventive maintenance to minimize total flowtime.•We present a mathematical model for this problem.•A memetic algorithm is improved with a hash map based population.•A hybrid local search is well designed.•Experimental results demonstrate the effectiveness of the proposed algorithm.

论文关键词：Memetic algorithm,Hash map,Preventive maintenance,Distributed scheduling problem,Total flowtime

论文评审过程：Received 29 March 2021, Revised 4 February 2022, Accepted 8 February 2022, Available online 15 February 2022, Version of Record 25 February 2022.

论文官网地址：https://doi.org/10.1016/j.knosys.2022.108413