A note on minimizing maximum lateness in a two-machine no-wait 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 (J. Oper. Res. Soc. 53(9) (2002) 1004) 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.