Semi-online scheduling with known maximum job size on two uniform machines

被引：4
|
作者：
Cao, Qian [1 ]
Liu, Zhaohui [1 ]
机构：
[1] E China Univ Sci & Technol, Dept Math, Shanghai 200237, Peoples R China
来源：
JOURNAL OF COMBINATORIAL OPTIMIZATION | 2010年 / 20卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Scheduling; Uniform machines; Semi-online; PROCESSORS; BOUNDS;
D O I：
10.1007/s10878-009-9214-0
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper, we investigate the semi-online scheduling problem with known maximum job size on two uniform machines with the speed ratio s >= 1. The objective is to minimize the makespan. Two algorithms are presented, where the first is optimal for 1.559 <= s <= 2 and s >= 3+root 17/2 . In addition, the improvement on lower bounds is made for 2 < s < 3+root 17/2.
引用
收藏
页码：369 / 384
页数：16
相关论文
共 50 条
12345