谢冬青
机械工业部科研基金
Xie Dongqing Ji Jie Zhao Yu
介绍了局内问题的竞争算法，给出了多种任务加工表局内问题的竞争算法。
The concepts of competitive algorithm are introduced and competitive algorithm for on line multiprocessor scheduling is obtained.The best upper bound of the algorithm's competitive rate is proved to be 2-1 m .
谢冬青.多种任务加工表局内问题的竞争算法[J].湖南大学学报：自然科学版,1998,25(4):
