Hybrid flow shop with multiple servers: A computational evaluation and efficient divide-and-conquer heuristics

作者：

Highlights：

• We address the hybrid flow shop with multiple servers.

• We present several theorems for the problem.

• We propose several constructive and composite heuristics to solve the problem.

• We compare the proposals with efficient algorithms in the literature.

摘要

•We address the hybrid flow shop with multiple servers.•We present several theorems for the problem.•We propose several constructive and composite heuristics to solve the problem.•We compare the proposals with efficient algorithms in the literature.

论文关键词：Scheduling,Hybrid flowshop,Secondary resource,Multiple-server,setup operator,Memory-based,Divide-and-conquer,Makespan,Heuristics

论文评审过程：Received 19 September 2019, Revised 13 April 2020, Accepted 16 April 2020, Available online 18 April 2020, Version of Record 27 April 2020.

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