ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES

被引:1
|
作者
ZHANG Yuzhong (Institute of Operations Research
机构
基金
中国国家自然科学基金;
关键词
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.
引用
收藏
页码:373 / 377
页数:5
相关论文
共 50 条