| Article ID: | iaor20021181 |
| Country: | China |
| Volume: | 18 |
| Issue: | 4 |
| Start Page Number: | 64 |
| End Page Number: | 66 |
| Publication Date: | Nov 2000 |
| Journal: | Journal of Hubei Institute for Nationalities |
| Authors: | Shi Ling, Tao Yong |
This paper discusses the ordered flowshop scheduling problem, which is proved to be NP-hard.