多种任务加工表局内问题的竞争算法

Competitive Algorithm for On-Line Multiprocessor Scheduling

介绍了局内问题的竞争算法，给出了多种任务加工表局内问题的竞争算法，估计了竞争率，并且证明了２－１ｍ是该竞争算法竞争率的最好上界，其中ｍ是机器台数．

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 .