An efficient memetic algorithm for distributed flexible job shop scheduling problem with transfers
作者：
Highlights：
• Distributed flexible job shop scheduling problem with transfers is studied.
• An efficient memetic algorithm (EMA) is proposed to solve the problem.
• A well-designed initialization method is presented to obtain a good initial population.
• Three effective neighbourhood structures are designed to expand the EMA’s solution space.
• Results show that the EMA is superior in terms of solution quality and efficiency.
摘要
•Distributed flexible job shop scheduling problem with transfers is studied.•An efficient memetic algorithm (EMA) is proposed to solve the problem.•A well-designed initialization method is presented to obtain a good initial population.•Three effective neighbourhood structures are designed to expand the EMA’s solution space.•Results show that the EMA is superior in terms of solution quality and efficiency.
论文关键词：Distributed flexible job shop scheduling,Operation transfer,Memetic algorithm,Multi-objective optimization,Taguchi method
论文评审过程：Received 3 September 2019, Revised 30 June 2020, Accepted 3 July 2020, Available online 19 July 2020, Version of Record 28 July 2020.
论文官网地址：https://doi.org/10.1016/j.eswa.2020.113721
