A matrix-cube-based estimation of distribution algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times

作者：

Highlights：

• A fast Insert-based neighbor evaluation is proposed to accelerate the local search.

• A diversity controlling mechanism is used to avoid stagnation of the global search.

• A multidimensional probabilistic model is designed to learn promising patterns.

• A local search controlled by the probabilistic model in global search is devised.

• Two heuristics are presented to generate high-quality initial individuals.

摘要

•A fast Insert-based neighbor evaluation is proposed to accelerate the local search.•A diversity controlling mechanism is used to avoid stagnation of the global search.•A multidimensional probabilistic model is designed to learn promising patterns.•A local search controlled by the probabilistic model in global search is devised.•Two heuristics are presented to generate high-quality initial individuals.

论文关键词：Blocking flow-shop scheduling,Estimation of distribution algorithm,Setup times,Multi-dimensional probabilistic model,Iterated local search

论文评审过程：Received 6 March 2022, Revised 4 May 2022, Accepted 14 May 2022, Available online 21 May 2022, Version of Record 1 June 2022.

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