A knowledge-driven constructive heuristic algorithm for the distributed assembly blocking flow shop scheduling problem

作者：

Highlights：

• The mixed integer linear programming model (MILP) of DABFSP is designed.

• A knowledge-driven constructive heuristic (KDH) algorithm is proposed to address DABFSP.

• Three different kinds of neighborhood knowledge are refined.

• The quantitative representation of the knowledge is extracted from the feature of DABFSP.

• The results of statistical analysis show the performance of the KDH algorithm.

摘要

•The mixed integer linear programming model (MILP) of DABFSP is designed.•A knowledge-driven constructive heuristic (KDH) algorithm is proposed to address DABFSP.•Three different kinds of neighborhood knowledge are refined.•The quantitative representation of the knowledge is extracted from the feature of DABFSP.•The results of statistical analysis show the performance of the KDH algorithm.

论文关键词：Distributed assembly blocking flow shop scheduling problem,Constructive heuristic,Assembly completion time,Knowledge-driven constructive heuristic algorithm

论文评审过程：Received 14 February 2022, Revised 18 March 2022, Accepted 15 April 2022, Available online 19 April 2022, Version of Record 27 April 2022.

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