We consider the scheduling model with two identical machines and jobs which arrive online in a list and are assigned to the machines with the objective of minimizing the makespan. Differently from the pure online version, we know in advance a lower bound and also an upper bound on the total size of all jobs. Our algorithm improves previous results on some interval of r, where r is the ratio of the upper and lower bounds on the total size. For most ranges of r our algorithm is best possible. Our technique is based on a smart application of so-called “safe sets”.

中文翻译：

---

一种给定总处理时间下界和上界的两机调度改进参数算法

我们考虑具有两台相同机器和作业的调度模型，这些机器和作业以列表形式在线到达并分配给机器，目的是最小化完工时间。与纯在线版本不同，我们预先知道所有作业总大小的下限和上限。我们的算法改进了的一些间隔之前的结果- [R ，其中[R是总尺寸的上限和下限之比。对于r的大多数范围，我们的算法是最好的。我们的技术基于所谓的“安全集”的智能应用。