Minimizing makespan in a two-machine flowshop with a limited waiting time constraint and sequence-dependent setup times
详细信息 查看全文
- 作者：Young-Jin Ana ; ofmine@kaist.ac.kr" class="auth_mail" title="E-mail the corresponding author ; Yeong-Dae Kimb ; Seong-Woo Choic
- 关键词：Scheduling ; Flowshop ; Branch and bound ; Limited waiting time ; Sequence-dependent setup time
- 刊名：Computers and Operations Research
- 出版年：2016
- 出版时间：July 2016
- 年：2016
- 卷：71
- 期：Complete
- 页码：127-136
- 全文大小：392 K
文摘
- •
We consider a two-machine flowshop problem with a limited waiting time constraint.
- •
We develop a branch-and-bound algorithm with new lower bounds and upper bounds.
- •
A lower bound obtained from Kruskal’s algorithm is more effective than others.
- •
Proposed dominance properties help to reduce computation time to solve the problem.