Two-machine flowshop scheduling with consecutive availability constraints

被引:34
|
作者
Cheng, TCE [1 ]
Wang, GQ
机构
[1] Hong Kong Polytech Univ, Off Vice President Res & Postgrad Studies, Kowloon, Hong Kong
[2] Jinan Univ, Dept Business Adm, Guangzhou, Peoples R China
[3] Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong
关键词
algorithms; flowshop scheduling; worst-case analysis;
D O I
10.1016/S0020-0190(99)00094-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we study a special case of the two-machine flowshop problem with an availability constraint imposed on each machine. The two availability constraints are consecutive. We establish some basic properties for the semiresumable case, i.e. if a job cannot be finished before the next down period of a machine, then the job will be partially restarted when the machine becomes available again. We provide a heuristic for the problem and show that it has a worst-case error bound of 2/3 for the nonresumable case. (C) 1999 Published by Elsevier Science B.V. All rights reserved.
引用
收藏
页码:49 / 54
页数:6
相关论文
共 50 条