期刊
COMPUTERS & OPERATIONS RESEARCH
卷 28, 期 7, 页码 689-704出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0548(00)00004-6
关键词
assembly problem; flowshop scheduling; approximation/heuristic; worst-case analysis
We consider the three-stage assembly flowshop scheduling problem with the objective of minimizing the makespan. The three-stage assembly problem generalizes both the serial three machine flowshop problem and the two-stage assembly flowshop scheduling problem and is therefore strongly NP-hard. We analyze the worst-case ratio bound for several heuristics for this problem. We also analyze the worst-case absolute bound for a heuristic based on compact vector summation techniques and we point out that, for a large number of jobs, this heuristic becomes asymptotically optimal. (C) 2001 Elsevier Science Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据