.png){kind=icon}
返回
A novel discrete water wave optimization algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2017.12.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper considers n-job m-machines blocking flow-shop scheduling problem (BFSP) with sequence-dependent setup times (SDST), which has important ramifications in the modern industry. To solve this problem, two efficient heuristics are firstly presented according to the property of the problem. Then, a novel discrete water wave optimization (DWWO) algorithm is proposed. In the proposed DWWO, an initial population with high quality and diversity is constructed based on the presented heuristic and a perturbation procedure. A two-stage propagation is designed to direct the algorithm towards the good solutions. The path relinking technique is employed in refraction phase to help individuals escape from local optima. A variable neighborhood search is developed and embedded in breaking phase to enhance local exploitation capability. A new population updating scheme is applied to accelerate the convergence speed. Moreover, a speedup method is presented to reduce the computational efforts needed for evaluating insertion neighborhood. Finally, extensive numerical tests are carried out, and the results compared to some state-of-the-art metaheuristics demonstrate the effectiveness of the proposed DWWO in solving BFSP with SDST.
Keyword:
Flow shop with blocking
Setup times
Scheduling
Heuristic
Metaheuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
暂无机构信息
引用论文
.png){kind=icon}
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking带有阻塞的流水车间中总迟到最小化的一些启发式算法
PREAI
分享收藏分享收藏An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
PREAI
分享收藏
查看更多内容