Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time

被引:0
|
作者
Li, Wenjie [1 ]
Liu, Hailing [2 ]
Li, Shisheng [3 ]
机构
[1] Luoyang Normal Univ, Sch Math Sci, Luoyang 471934, Henan, Peoples R China
[2] Henan Inst Engn, Coll Sci, Zhengzhou 451191, Henan, Peoples R China
[3] Zhongyuan Univ Technol, Dept Informat & Computat Sci, Zhengzhou 450007, Henan, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; online algorithm; kind release time; total weighted completion time; SINGLE-MACHINE; REJECTION COST; RELEASE DATES; ALGORITHMS; PLUS;
D O I
10.1142/S0217595918500240
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies online scheduling on m identical parallel machines under the KRT environment, where jobs arrive over time and "KRT" means that in the online setting no jobs can be released when all of the machines are busy. The goal is to determine a feasible schedule to minimize the total of weighted completion times. When m = 1, we prove that WSPT is an optimal online algorithm. When m >= 2, we first present a lower bound m(2)-2+root m(4)-4m+4/2m(m-1), and then show that WSPT is a 2-competitive online algorithm for the case m = 2. For the case in which m = 2 and all jobs have equal processing times, we provide a best possible online algorithm with a competitive ratio of 1+root 3/2.
引用
收藏
页数:12
相关论文
共 50 条