Scatter search for mixed blocking flowshop scheduling

作者：

Highlights：

• A scatter search algorithm for mixed blocking permutation flowshop scheduling.

• A new and effective NEH-based heuristic is used in initial solution generation.

• A greedy job selection within insert and swap operators are used in local search.

• Outperforms state-of-the-art algorithms on well-known benchmark problem sets.

摘要

•A scatter search algorithm for mixed blocking permutation flowshop scheduling.•A new and effective NEH-based heuristic is used in initial solution generation.•A greedy job selection within insert and swap operators are used in local search.•Outperforms state-of-the-art algorithms on well-known benchmark problem sets.

论文关键词：Flowshop scheduling,Mixed blocking constraints,Heuristic algorithms,Meta-heuristic algorithms,Scatter search

论文评审过程：Received 28 September 2016, Revised 15 February 2017, Accepted 16 February 2017, Available online 20 February 2017, Version of Record 28 February 2017.

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