中文摘要：

研究m台批处理机上的等长工件在线排序问题.在该问题中,工件是随着时间依次到达的,每个工件J具有一个共同的加工时间p〉0,一个释放时间rj≥0,一个必须交货期dj〉0.一台机器可以同时加工b个工件（b个工件构成一批）,b=∞表示批容量无界.每一批的加工时间由该批中工件的最长加工时间来决定.同一批中的所有工件均具有相同的开工时间和完工时间,目标是确定一个工件可以被中断重启的在线排序最大化接收工件总个数.首先,当m=2、3时分别给出了问题的下界为2和6/5.其次,设计出了问题的一个在线算法H并证明其竞争比分别为3（当m=2时）、4（当m=3或m≥4为偶数时）和5（当m≥5为奇数时）.

英文摘要：

The online scheduling of equal-length jobs was studied on m identical batch machines. In this problem, jobs arrive over time and each job needed a common processing time p 〉 0, a release time rj ≥ 0, a deadline dj 〉 0. Each batch machine can process up to b jobs simultaneously as a batch. ＂b = w ＂ means that the capacity of batch was unbounded. The goal was to determine a preemption-restart schedule which maximizes the total number of the accepted jobs. A lower bound of 2 for m = 2 and 6/5 for m = 3, was presented respectively. An online algorithm H was provided with a competitive ratio of 3 （when m = 2） , 4（when m =3 or m≥4 is even） , 5（when m≥5 is odd） , respectively.