Zhang, Xiandong; van de Velde, Steef - In: European Journal of Operational Research 216 (2012) 3, pp. 544-552
We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson’s rule. For...