Heuristics for the mixed no-idle flowshop with sequence-dependent setup times and total flowtime criterion

作者：

Highlights：

• We study the mixed no-idle flowshop scheduling problem with setup times.

• We develop a new set of efficient heuristics for total flowtime minimization.

• We compare our proposal with the best heuristics adapted from other problems.

• We test the heuristics through statistical and computational experimentation.

摘要

•We study the mixed no-idle flowshop scheduling problem with setup times.•We develop a new set of efficient heuristics for total flowtime minimization.•We compare our proposal with the best heuristics adapted from other problems.•We test the heuristics through statistical and computational experimentation.

论文关键词：Flowshop,No-idle,Setup time,Heuristics,Total flowtime

论文评审过程：Received 15 September 2018, Revised 18 January 2019, Accepted 18 January 2019, Available online 27 January 2019, Version of Record 4 February 2019.

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