| Article ID: | iaor20013928 |
| Country: | China |
| Volume: | 4 |
| Issue: | 1 |
| Start Page Number: | 43 |
| End Page Number: | 49 |
| Publication Date: | Feb 2000 |
| Journal: | OR Transactions |
| Authors: | Liu Zhaohui, Yu Wenci |
| Keywords: | flowshop |
In this paper, the authors investigate the computational complexity of some special cases of the three-machine flow-shop problem to minimize the makespan. NP-hardness is established for each of the following cases: all jobs require the same processing time on the second machine; all jobs require the same processing time on the first machine and the last machine; each job has at least one zero operation; each job contains a missing operation.