| Article ID: | iaor2005508 |
| Country: | United Kingdom |
| Volume: | 31 |
| Issue: | 12 |
| Start Page Number: | 2111 |
| End Page Number: | 2115 |
| Publication Date: | Oct 2004 |
| Journal: | Computers and Operations Research |
| Authors: | Dileepan Parthasarati |
| Keywords: | flowshop |
Job scheduling for a two-machine flowshop where wait time between the first and the second machine is not permitted is studied in this paper. Aldowaisan and Allahverdi considered this problem with minimizing total flowtime as the scheduling criterion and presented some necessary conditions for optimality. In this note their results have been modified for the scheduling criterion of minimizing maximum lateness.