.png){kind=icon}
返回
The two-machine total completion time flow shop problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(95)00351-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we study the NP-hard scheduling problem of minimizing total completion time in a two-machine now shop. Five known lower bounds are discussed and two new ones are presented. A new dominance criterion is also proposed. Several versions of a branch and bound method are derived by applying, both individually and combined, these lower bounds. A heuristic procedure is also presented that uses a constructive O(n(2)) time method, which computes a good starting solution, together with a neighborhood search based on pairwise interchanges. Computational results show that the exact method can handle problems of up to 30 jobs in size within a reasonable amount of time and that the heuristic procedure has an average error of less than 0.5% from the optimal value and less than 2.7% from the lower bound.
Keyword:
flow shop scheduling
branch and bound
neighborhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
The Diagnostic Validity of Melancholic Major Depression in a Population-Based Sample of Female Twins
PREAI
分享收藏
分享收藏
分享收藏Survival Experience Following Nd:YAG Laser Photoresection for Primary Bronchogenic Carcinoma.png)
Chest
ChestIF0
PREAI
分享收藏 没有更多内容
没有更多内容