Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time
作者：
Highlights：
• This work studies the distributed reentrant permutation flow shop scheduling.
• The inclusion of sequence-dependent setup times into the problem is analyzed.
• The goal is to minimize the makespan, production cost, and tardiness.
• We propose an improved multi-objective adaptive large neighborhood search.
• The algorithm is equipped with solution acceptance and archive updating criteria.
摘要
•This work studies the distributed reentrant permutation flow shop scheduling.•The inclusion of sequence-dependent setup times into the problem is analyzed.•The goal is to minimize the makespan, production cost, and tardiness.•We propose an improved multi-objective adaptive large neighborhood search.•The algorithm is equipped with solution acceptance and archive updating criteria.
论文关键词：Multi-objective scheduling,Distributed manufacturing,Reentrant flow shop,Sequence-dependent setup time,Improved adaptive large neighborhood search
论文评审过程：Received 8 July 2020, Revised 9 October 2020, Accepted 2 June 2021, Available online 9 June 2021, Version of Record 19 June 2021.
论文官网地址：https://doi.org/10.1016/j.eswa.2021.115339
