In this paper,we consider the on-line scheduling of unit time jobs with rejection on midentical parallel machines.The objective is to minimize the total completion time of the acceptedjobs plus the total penalty of the rejected jobs.We give an on-line algorithm for the problem withcompetitive ratio(1/2)(2+3)≈1.86602.
机构:
Univ Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R ChinaUniv Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R China
Chan, Wun-Tat
Chin, Francis Y. L.
论文数: 0引用数: 0
h-index: 0
机构:
Univ Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R ChinaUniv Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R China
Chin, Francis Y. L.
Ye, Deshi
论文数: 0引用数: 0
h-index: 0
机构:
Univ Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R ChinaUniv Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R China
Ye, Deshi
Zhang, Guochuan
论文数: 0引用数: 0
h-index: 0
机构:
Zhejiang Univ, Dept Math, Hangzhou 310027, Zhejiang, Peoples R ChinaUniv Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R China
Zhang, Guochuan
Zhang, Yong
论文数: 0引用数: 0
h-index: 0
机构:
Univ Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R ChinaUniv Hong Kong, Dept Comp Sci, Pokfulam Rd, Hong Kong, Hong Kong, Peoples R China