| Article ID: | iaor1992519 |
| Country: | United Kingdom |
| Volume: | 42 |
| Issue: | 6 |
| Start Page Number: | 479 |
| End Page Number: | 192 |
| Publication Date: | Jun 1991 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Strusevich V.A. |
The paper introduces the two-machine super-shop scheduling problem to minimize makespan. The well-known flow-shop, open-shop, job-shop and mixed-shop scheduling problems are special cases of the present model. A polynomial-time algorithm to find both pre-emptive and non-pre-emptive optimal schedules is described.