.png){kind=icon}
返回
A matrix-cube-based estimation of distribution algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2022.117602.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The blocking flow-shop scheduling problem with sequence-dependent setup times (BFSP_SDST) is a strong NP- hard problem that exists widely in practice. However, research on this issue is still quite limited. Hence, this paper presents a novel matrix-cube-based estimation of distribution algorithm (MCEDA) to minimize the makespan criterion of the BFSP_SDST. In MCEDA's global search, a matrix cube is devised to reasonably learn the promising patterns in excellent solutions or individuals, and then a matrix-cube-based probabilistic model is developed to quickly guide global search toward the potential promising regions in solution space. A diversity controlling mechanism is also added to avoid the stagnation of global search. In MCEDA's local search, an iterated multi-neighborhood local search controlled by the probabilistic model in global search is designed to execute deeper exploitation from those promising regions. Additionally, two constructive heuristics for gener-ating high-quality initial individuals and one fast Insert-based neighbor evaluation method for accelerating the efficiency of local search are presented based on an analysis of the problem's features. MCEDA's efficacy and superiority in solving the BFSP SDST are demonstrated through comprehensive comparisons with 22 state-of-the- art algorithms.
Keyword:
Blocking flow-shop scheduling
Estimation of distribution algorithm
Setup times
Multi-dimensional probabilistic model
Iterated local search
期刊
IF:
7.5
论文数:
3.0W
被引数:
10.2W
机构
引用论文
.png){kind=icon}
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking带有阻塞的流水车间中总迟到最小化的一些启发式算法
PREAI
分享收藏Solving system-level synthesis problem by a multi-objective estimation of distribution algorithm
PREAI
分享收藏
An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
PREAI
分享收藏
查看更多内容