| Article ID: | iaor1994603 |
| Country: | United Kingdom |
| Volume: | 20 |
| Issue: | 6 |
| Start Page Number: | 597 |
| End Page Number: | 611 |
| Publication Date: | Aug 1993 |
| Journal: | Computers and Operations Research |
| Authors: | Strusevich Vitaly A. |
An algorithm for minimizing the makespan for the two machine open shop scheduling problem with setup, processing and removal times separated is presented. The running time of the algorithm is linear with respect to the number of jobs.