A distributed permutation flowshop scheduling problem with the customer order constraint

作者：

Highlights：

• We introduce the customer order constraint into the DPFSP.

• We build an MILP model to formulate this new problem.

• We propose three heuristics inspired by the NEH2 method.

• We develop three meta-heuristics with problem-specific strategies.

• Experimental results demonstrate the effectiveness of presented algorithms.

摘要

•We introduce the customer order constraint into the DPFSP.•We build an MILP model to formulate this new problem.•We propose three heuristics inspired by the NEH2 method.•We develop three meta-heuristics with problem-specific strategies.•Experimental results demonstrate the effectiveness of presented algorithms.

论文关键词：Distributed scheduling,Flowshop,Customer order,Heuristics,Variable neighborhood search,Artificial bee colony,Iterated greedy

论文评审过程：Received 23 January 2019, Revised 23 July 2019, Accepted 28 July 2019, Available online 1 August 2019, Version of Record 11 October 2019.

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