手机知网 App
24小时专家级知识服务
打 开
手机知网|搜索

ON-LINE PREEMPTIVE SCHEDULING ON UNIFORM MACHINES


  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), S1S2Sm being the speeds of the m machines.……   
App内打开