| Article ID: | iaor1993980 |
| Country: | Belgium |
| Volume: | 30 |
| Start Page Number: | 35 |
| End Page Number: | 48 |
| Publication Date: | Mar 1990 |
| Journal: | Belgian Journal of Operations Research, Statistics and Computer Science |
| Authors: | Jozefowska Joanna |
| Keywords: | flowshop |
The two-machine flow shop system is considered. Every task performed in the system consists of two unit-length operations. Ready times of all tasks are equal and arbitrary precedence constraints between tasks are allowed. An algorithm constructing the makespan-and mean flow time optimal schedule is presented. Its complexity is O(