A factorial based particle swarm optimization with a population adaptation mechanism for the no-wait flow shop scheduling problem with the makespan objective

作者：

Highlights：

• An FPAPSO algorithm is proposed for solving NWFSP.

• The factorial representation is employed to map the search space to integer domain.

• A VNS is introduced to search around the promising area in each generation.

• The PA mechanism is designed to control the diversity of population.

• The runtime analysis of FPAPSO is performed with the level-based theorem.

摘要

•An FPAPSO algorithm is proposed for solving NWFSP.•The factorial representation is employed to map the search space to integer domain.•A VNS is introduced to search around the promising area in each generation.•The PA mechanism is designed to control the diversity of population.•The runtime analysis of FPAPSO is performed with the level-based theorem.

论文关键词：Particle swarm optimization,No-wait flow shop scheduling problem,Factorial representation,Runtime analysis,Variable neighborhood search,Makespan

论文评审过程：Received 19 October 2018, Revised 21 January 2019, Accepted 22 January 2019, Available online 14 February 2019, Version of Record 19 February 2019.

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