A referenced iterated greedy algorithm for the distributed assembly mixed no-idle permutation flowshop scheduling problem with the total tardiness criterion

作者：

Highlights：

• We study a distributed assembly mixed no-idle permutation flowshop scheduling.

• A mixed-integer linear programming model is presented.

• A Referenced Iterated greedy (RIG) algorithm is proposed.

• Experimental results show that the effectiveness of our algorithm.

摘要

•We study a distributed assembly mixed no-idle permutation flowshop scheduling.•A mixed-integer linear programming model is presented.•A Referenced Iterated greedy (RIG) algorithm is proposed.•Experimental results show that the effectiveness of our algorithm.

论文关键词：Iterated greedy,Mixed no-idle,Distributed assembly permutation flowshop scheduling,Total tardiness

论文评审过程：Received 14 October 2021, Revised 5 December 2021, Accepted 19 December 2021, Available online 24 December 2021, Version of Record 10 January 2022.

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