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 .
