.png){kind=icon}
返回
Optimizing blocking flow shop scheduling problem with total completion time criterion
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2013.02.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The blocking flow shop scheduling problem has found many applications in manufacturing systems. There are a few exact methods for solving this problem with different criteria. In this paper, efforts will be made to optimize the total completion time criterion for this problem. We present two mixed binary integer programming models, one of which is based on the departure times of jobs from machines, and the other is based on the idle and blocking times of jobs. An initial upper bound generator and some lower bounds and dominance rules are also developed to be used in a branch and bound algorithm. The algorithm solves 17 instances of the Taillard's benchmark problem set in less than 20 min. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Scheduling
Blocking flow shop
Total completion time
Mixed binary integer programming model
Branch and bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Some heuristic algorithms for total tardiness minimization in a flowshop with blocking带有阻塞的流水车间中总迟到最小化的一些启发式算法
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分享收藏A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems一种求解阻塞流水车间调度问题的混合离散差分进化算法
PREAI
分享收藏分享收藏
查看更多内容