Approximability of two-machine no-wait flowshop scheduling with availability constraints

被引:32
|
作者
Cheng, TCE [1 ]
Liu, ZH
机构
[1] Hong Kong Polytech Univ, Dept Management, Kowloon, Hong Kong, Peoples R China
[2] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
关键词
scheduling; approximation scheme;
D O I
10.1016/S0167-6377(02)00230-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider in this paper the two-machine no-wait flowshop scheduling problem in which each machine may have an unavailable interval. We present a polynomial time approximation scheme for the problem when the unavailable interval is imposed on only one machine, or the unavailable intervals on the two machines overlap. (C) 2003 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:319 / 322
页数:4
相关论文
共 50 条