| Article ID: | iaor19972288 |
| Country: | Germany |
| Volume: | 43 |
| Issue: | 2 |
| Start Page Number: | 233 |
| End Page Number: | 238 |
| Publication Date: | Mar 1996 |
| Journal: | Mathematical Methods of Operations Research (Heidelberg) |
| Authors: | Sotskov Y.N., Kravchenko S.A. |
This paper deals with the problem of scheduling three jobs on two machines in order to minimize the makespan, when operation preemptions are forbidden and routes are fixed and may vary per job. It is shown that this problem can be solved by an