Scheduling on uniform parallel machines to minimize maximum lateness

被引:18
|
作者
Koulamas, C [1 ]
Kyparisis, GJ [1 ]
机构
[1] Florida Int Univ, Coll Business Adm, Dept Decis Sci & Informat Syst, Miami, FL 33199 USA
关键词
scheduling; parallel machines; approximation/heuristic; worst-case analysis;
D O I
10.1016/S0167-6377(00)00018-3
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the uniform parallel machine scheduling problem with the objective of minimizing maximum lateness. We show that an extension of the EDD rule to a uniform parallel machine setting yields a maximum lateness value which does not exceed the optimal value by more than p(max), where p(max) is the maximum job processing time. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:175 / 179
页数:5
相关论文
共 50 条