| Article ID: | iaor2001233 |
| Country: | United States |
| Volume: | 47 |
| Issue: | 4 |
| Start Page Number: | 353 |
| End Page Number: | 358 |
| Publication Date: | Jun 2000 |
| Journal: | Naval Research Logistics |
| Authors: | Vlach Milan, epek Ondej, Okada Masanori |
| Keywords: | flowshop |
In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified.