.png){kind=icon}
返回
Invasive weed optimization algorithm for optimization no-idle flow shop scheduling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.05.063.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, an invasive weed optimization (IWO) scheduling algorithm is presented for optimization no-idle flow-shop scheduling problem (NFSP) with the criterion to minimize the maximum completion time (makespan). Firstly, a simple approach is put forward to calculate the makespan of job sequence. Secondly, the most position value (MPV) method is used to code the weed individuals so that fitness values can be calculated. Then, use the global exploration capacity of IWO to select the best fitness value and its corresponding processing sequence of job by evaluating the fitness of individuals. The results of 12 different scale NFSP benchmarks compared with other algorithms show that NFSP can be effectively solved by IWO with stronger robustness. (C) 2014 Elsevier B.V. All rights reserved.
Keyword:
No-idle flow shop scheduling problem
Invasive weed optimization
Makespan
Most position value method
Global exploration capacity
Robustness
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
A novel adaptive sequential niche technique for multimodal function optimization.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏Shape recognition based on neural networks trained by differential evolution algorithmNEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏A review on separation and application of plant‐derived exosome‐like nanoparticles植物来源外泌体样纳米粒的分离与应用综述
PREAI
分享收藏
Inventions on keeping properties and non‐reactive ingredients in chemical leavening关于保持性质和非活性成分在化学膨松剂中的发明
OAAI
OAAI分享收藏
查看更多内容