On-line scheduling;
uniformly related machines;
preemption;
competitive ratio;
D O I:
暂无
中图分类号:
O223 [统筹方法];
学科分类号:
070105 ;
1201 ;
摘要:
We address the problem of preemptively schedule on-line jobs on arbitrary m uniformly related machines with the objective of minimizing the schedule length. We provide the first on-line algorithm for this general problem, and show that the algorithm has a competitive ratio of 1 ± σ, where a (m - 1)s1/(si +…+ sm), S1 S2 Sm being the speeds of the m machines.
机构:
Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
Hennan Key Lab Financial Engn, Zhengzhou 450001, Henan, Peoples R ChinaZhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
Li, Wenhua
Chai, Xing
论文数: 0引用数: 0
h-index: 0
机构:
Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R ChinaZhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China
Chai, Xing
Song, Yali
论文数: 0引用数: 0
h-index: 0
机构:
Zhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R ChinaZhengzhou Univ, Sch Math & Stat, Zhengzhou 450001, Henan, Peoples R China