| Article ID: | iaor20021191 |
| Country: | China |
| Volume: | 27 |
| Issue: | 4 |
| Start Page Number: | 382 |
| End Page Number: | 387 |
| Publication Date: | Jul 2000 |
| Journal: | Journal of Zhejiang University (Sciences Edition) |
| Authors: | Su Chunjie, Yao Enyu |
| Keywords: | flowshop |
The classic flow shop problem is widely researched. In this paper, the flowshop problem with a server is considered. It is proved that this problem is strongly NP-Complete. Then an approximate algorithm with worst performance ratio 2 is constructed, and two polynomial solvable cases are also given.