A Pareto based discrete Jaya algorithm for multi-objective flexible job shop scheduling problem

作者：

Highlights：

• A novel Pareto based discrete Jaya algorithm is developed to address the MOFJSSP.

• A problem specific local search is integrated to improve exploitation capability.

• A modified crowding distance operator is proposed to improve diversity.

• Results of 203 benchmark instances demonstrate the superiority of our approach.

摘要

•A novel Pareto based discrete Jaya algorithm is developed to address the MOFJSSP.•A problem specific local search is integrated to improve exploitation capability.•A modified crowding distance operator is proposed to improve diversity.•Results of 203 benchmark instances demonstrate the superiority of our approach.

论文关键词：Multi-objective optimization,Local search,Flexible job shop environment,Discrete Jaya algorithm,Modified crowding distance

论文评审过程：Received 27 November 2019, Revised 10 August 2020, Accepted 1 January 2021, Available online 5 January 2021, Version of Record 12 January 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.114567