The paper considers the three-machine open shop scheduling problem to minimize the makespan. In the model, each job consists of two operations, one of which is to be processed on the bottleneck machine, which is the same for all jobs. A new linear-time algorithm to find an optimal non-preemptive schedule is developed. The suggested algorithm considerably simplifies the only previously known method as it straightforwardly exploits the structure of the problem and its key components to yield an optimal solution.

中文翻译：

---

重温瓶颈机的三机开店

本文考虑了三机开放车间调度问题以最小化完工时间。在模型中，每个作业由两个操作组成，其中一个要在瓶颈机器上处理，这对所有作业都是相同的。开发了一种新的线性时间算法来寻找最佳的非抢占调度。建议的算法大大简化了以前唯一已知的方法，因为它直接利用问题的结构及其关键组件来产生最佳解决方案。