An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem

作者：

Highlights：

• An iterated greedy algorithm for the total tardiness parallel blocking flow shop problem.

• Constructive heuristics which considers the characteristics of the problem.

• Design of experiments to calibrate and select the best variant.

摘要

•An iterated greedy algorithm for the total tardiness parallel blocking flow shop problem.•Constructive heuristics which considers the characteristics of the problem.•Design of experiments to calibrate and select the best variant.

论文关键词：Parallel flow shop,Distribution flow shop,Blocking,Scheduling,Total tardiness

论文评审过程：Received 21 April 2018, Revised 30 October 2018, Accepted 20 December 2018, Available online 23 December 2018, Version of Record 26 December 2018.

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