摘要
提出时间目标函数下的局内 k-军车调度问题 .应用复位策略给出该问题的几种竞争算法 :给出了对应的局内 k-服务器问题的竞争比为 c时的该问题的竞争比为 c+1+1/ θ的竞争算法 ;分别给出了当 k=n和 k=n- 1时该问题的竞争比为 1和
On line k military truck problem with objective function of time is originally proposed in this paper. Employing the position maintaining strategy, some competitive algorithms for this on line problem are given: an algorithm with competitive ratio c +1+1/ θ when the competitive ratio of relevant k server problem is c ; two algorithms with competitive ratio 1 and 1+1/ θ when k=n and k=n -1, respectively.
出处
《系统工程学报》
CSCD
2002年第5期395-400,429,共7页
Journal of Systems Engineering