| Article ID: | iaor20043095 |
| Country: | Netherlands |
| Volume: | 8 |
| Issue: | 1 |
| Start Page Number: | 13 |
| End Page Number: | 28 |
| Publication Date: | Mar 2004 |
| Journal: | Journal of Combinatorial Optimization |
| Authors: | Gladky A. A., Shafransky Y. M., Strusevich V. A. |
| Keywords: | flowshop |
The paper considers the flow shop scheduling problems to minimize the makespan, provided that an individual precedence relation is specified on each machine. A fairly complete complexity classification of problems with two and three machines is obtained.