Samarghandi, Hamed; ElMekkawy, Tarek Y. - In: European Journal of Industrial Engineering 5 (2011) 2, pp. 111-131
We consider the two-machine no-wait flow shop problem with separable setup times and single server side constraints, and makespan as the performance measure. This problem is strongly NP-hard. A mathematical model of the problem is developed and a number of propositions are proven for the special...