.png){kind=icon}
返回
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2011.02.013.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all, the largest position value (LPV) rule is proposed to convert continuous harmony vectors into job permutations. Second, an efficient initialization scheme based on the Nawaz-Enscore-Ham (NEH) heuristic is presented to construct the initial harmony memory with a certain level of quality and diversity. Third, harmony search is employed to evolve harmony vectors in the harmony memory to perform exploration, whereas a local search algorithm based on the insert neighborhood is embedded to enhance the local exploitation ability. Moreover, a new pitch adjustment rule is developed to well inherit good structures from the global-best harmony vector. Computational simulations and comparisons demonstrated the superiority of the proposed hybrid harmony search algorithm in terms of solution quality. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Metaheuristics
Blocking flow shop
Harmony search
Tabu Search
NEH heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
Analysis of the occurrence of early life stress in adult psychiatric patients: A systematic review.
OAAI
OAAI分享收藏A heuristic approach for tow-machine no-wait flowshop scheduling with due dates and class setupsOAAI
OAAI分享收藏Some heuristic algorithms for total tardiness minimization in a flowshop with blocking带有阻塞的流水车间中总迟到最小化的一些启发式算法
PREAI
分享收藏How do associations between sleep duration and metabolic health differ with age in the UK general population?.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏分享收藏
查看更多内容