A polynomial algorithm for the three-machine open shop with a bottleneck machine.

The paper considers the three-machine open shop scheduling problem to minimize the makespan. It is assumed that each job consists of at most two operations, one of which is to be processed on the bottleneck machine, the same for all jobs. A new lower bound on the optimal makespan is derived, and a linear-time algorithm for finding an optimal non-preemptive schedule is presented. [ABSTRACT FROM AUTHOR]