.png){kind=icon}
返回
An iterated greedy algorithm for the flowshop scheduling problem with blocking
.png){kind=icon}
PRE
AI
DOI：10.1016/j.omega.2010.07.007.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes an iterated greedy algorithm for solving the blocking flowshop scheduling problem for makespan minimization. Moreover, it presents an improved NEH-based heuristic, which is used as the initial solution procedure for the iterated greedy algorithm. The effectiveness of both procedures was tested on some of Taillard's benchmark instances that are considered to be blocking flowshop instances. The experimental evaluation showed the efficiency of the proposed algorithm, in spite of its simple structure, in comparison with a state-of-the-art algorithm. In addition, new best solutions for Taillard's instances are reported for this problem, which can be used as a basis of comparison in future studies. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Flowshop
Blocking
Makespan
Iterated local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
O
IF:
7.2
论文数:
3.7K
被引数:
1.4W
机构
引用论文
A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems一种求解阻塞流水车间调度问题的混合离散差分进化算法
PREAI
分享收藏An effective hybrid genetic algorithm for flow shop scheduling with limited buffers具有有限缓冲区的流水车间调度的有效混合遗传算法
PREAI
分享收藏An improved NEH heuristic to minimize makespan in permutation flow shops一种改进的NEH启发式方法，可最大程度地减少置换流水车间的制造时间
PREAI
分享收藏Angiographic Anatomy of the Left Ventricle and Mitral Valve in Idiopathic Hypertrophic Subaortic Stenosis.png)
Circulation
CirculationIF0
PREAI
分享收藏
查看更多内容