| Article ID: | iaor199790 |
| Country: | Netherlands |
| Volume: | 70 |
| Issue: | 3 |
| Start Page Number: | 391 |
| End Page Number: | 404 |
| Publication Date: | Nov 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Strusevich V.A., Shakhlevich N.V. |
The paper presents a linear-time algorithm for solving the two machine open shop scheduling problem to minimize an arbitrary regular penalty function depending on the lengths of periods during which the machines are used. Bot hte preemptive and the nonpreemptive cases of the problem are considered.