Semi-online scheduling on two uniform machines with the known largest size

被引：5

作者：

Cai, Sheng-Yi ^{[1
,2
]}

Yang, Qi-Fan ^{[1
]}

机构：

[1] Zhejiang Univ, Dept Math, Hangzhou 310003, Zhejiang, Peoples R China

[2] Wenzhou Univ, Sch Math & Informat Sci, Wenzhou 325035, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2011年 / 21卷 / 04期

关键词：

Analysis of algorithms; Scheduling; Semi-online; Competitive ratio; Uniform machine; PROCESSORS; ALGORITHMS;

D O I：

10.1007/s10878-009-9254-5

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper investigates semi-online scheduling on two uniform machines with the known largest size. Denote by s (j) the speed of each machine, j=1,2. Assume 0 < s (1)a parts per thousand currency signs (2), and let s=s (2)/s (1) be the speed ratio.

引用

页码：393 / 408

页数：16