This paper considers the no-wait scheduling of n jobs in a two-machine flow shop, where some jobs require processing on the first machine only. The objective is to minimize the maximum completion time ...

This paper considers the general, no-wait and no-idle flow shop scheduling problems with deteriorating jobs. By a deteriorating job we mean that the processing time is an increasing function of its ...