We consider the online scheduling on an unbounded (drop-line) parallel batch machine to minimize the time by which all jobs have been delivered. In this paper, all jobs arrive over time and the running batches are allowed limited restart. Here limited restart means that a running batch which contains restarted jobs cannot be restarted again. A drop-line parallel batch machine can process several jobs simultaneously as a batch, and all jobs in a batch start at the same time, and the completion time of a job equals the sum of its starting time and its processing time. Here we consider the restricted model: all jobs have agreeable processing times and delivery times. We provide a best possible online algorithm H with a competitive ratio of \(\frac{3}{2}\) for the problem on an unbounded parallel batch machine and the corresponding problem on an unbounded drop-line parallel batch machine, respectively.

我们考虑在无限制（并行）批处理计算机上进行在线调度，以最大程度地缩短所有作业的交付时间。在本文中，所有作业都会随着时间的推移而到达，并且允许运行中的批次有限重启。在此，有限的重新启动意味着包含重新启动的作业的正在运行的批处理无法再次重新启动。一台并行生产线的并行批处理机可以同时处理多个作业，并且一个批次中的所有作业都同时开始，并且作业的完成时间等于其开始时间与处理时间的总和。在这里，我们考虑受限模型：所有作业的处理时间和交付时间都一致。我们提供具有竞争比\（\ frac {3} {2} \）的最佳在线算法H 分别针对无边界并行批处理机器上的问题和无边界下拉线并行批处理机器上的相应问题。