An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times

作者：

Highlights：

• The FJSPs with transportation and setup time are considered.

• Two objectives are optimized simultaneously.

• Seven different types of local search approaches are proposed.

• SA-based acceptation criterion is embedded.

摘要

•The FJSPs with transportation and setup time are considered.•Two objectives are optimized simultaneously.•Seven different types of local search approaches are proposed.•SA-based acceptation criterion is embedded.

论文关键词：Flexible job shop,Improved Jaya algorithm,Energy consumption,Transportation time,Setup time

论文评审过程：Received 3 January 2020, Revised 11 April 2020, Accepted 13 May 2020, Available online 18 May 2020, Version of Record 19 May 2020.

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