The problem to be considered is one of scheduling n jobs in a two-machine flow shop. Jobs are characterized by processing times and set-up times. Moreover, some subsets of jobs are to be processed in a no-wait mode before specified deadlines. The objective is to find a schedule of minimum length. In the paper an optimization algorithm is proposed, its complexity, however, is not evaluated.