.png){kind=icon}
返回
N-NEH plus algorithm for solving permutation flow shop problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105296.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Permutation flow shop scheduling problem with makespan criterion is known to be NP-hard if the number of machines is greater than two. The most known polynomial complexity algorithm for solving PFSP is the constructive NEH heuristic. In this paper we propose the N-NEH+ algorithm which extends the classical NEH heuristic and which is, to our best knowledge, the first deterministic constructive algorithm that can produce a family of solutions having equal quality. The main idea of the N-NEH+ algorithm is to use a list (called N-list) of N jobs to be candidates for partial sequencing. The results of the extensive numerical experiments confirm that the N-list technique performs well in improving the NEH heuristic. Moreover, the proposed approach can be easily adapted for a multi-core processing environment, which is very difficult with other constructive algorithms. Another advantage of the proposed technique is that it can be used to improve many other algorithms for solving permutation flow shop problems.
Keyword:
Permutation flow shop
Heuristics
N-NEH plus
N-list technique
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容