A note on parallel-machine scheduling with deteriorating jobs

被引:6
|
作者
Jeng, A. A. K.
Lin, B. M. T. [1 ]
机构
[1] Natl Chiao Tung Univ, Dept Informat & Finance Management, Hsinchu 300, Taiwan
[2] Natl Chiao Tung Univ, Dept Comp & Informat Sci, Hsinchu 300, Taiwan
关键词
parallel-machine scheduling; time-dependent processing time; lower bound;
D O I
10.1057/palgrave.jors.2602208
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider a parallel-machine scheduling problem of minimizing the total completion time. The processing time of a job is a linear function of its starting time and deterioration rate. This problem is known to be NP-hard, even for the case with two machines. In this note, we generalize an existing lower bound for the two-machine case to the general case with an arbitrary number of machines. Despite the generalization concerning machine number, our bound has one extra term that makes our bound tighter than the existing one.
引用
收藏
页码:824 / 826
页数:3
相关论文
共 50 条