.png){kind=icon}
返回
A note on constructive heuristics for the flowshop problem with blocking
.png){kind=icon}
PRE
AI
DOI：10.1016/S0925-5273(03)00065-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper analyzes the minimization of the makespan criterion for the flowshop problem with blocking. In this environment, there are no buffers between successive machines, and therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. As the problem is NP-hard, a constructive heuristic that explores specific characteristics of the problem is developed. The small computational effort of such strategy, which is valuable in practical applications, is one of the reasons that motivated this study. The performance of a combination of the proposed method with existing ones is examined through a comparative study. The new methods outperform the NEH algorithm, currently the best constructive heuristic for this problem, in problems with up to 500 jobs and 20 machines. (C) 2003 Elsevier Science B.V. All rights reserved.
Keyword:
scheduling
flowshop
blocking
makespan
heuristic
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10
论文数:
8.1K
被引数:
3.6W
机构
暂无机构信息
引用论文
Tabu search for total tardiness minimization in flowshop scheduling problems禁忌搜索flowshop调度问题中的总迟到最小化
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分享收藏Theoretical Study on the Catalytic Reduction Mechanism of NO by CO on Tetrahedral Rh4 Subnanocluster
PREAI
分享收藏
查看更多内容