| Article ID: | iaor20013351 |
| Country: | United States |
| Volume: | 9 |
| Issue: | 4 |
| Start Page Number: | 367 |
| End Page Number: | 378 |
| Publication Date: | Dec 2000 |
| Journal: | Production and Operations Management |
| Authors: | Sriskandarajah Chelliah, Cheng T.C. Edwin, Wang Guoqing |
| Keywords: | flowshop |
In this paper we study the time complexities of some two- and three-stage no-wait flowshop makespan scheduling problems where, in some stage, all the jobs require a constant processing time and the stage may consist of parallel identical machines. Polynomial time algorithms are presented for certain problems, while several others are proved to be strongly NP-complete.