Choi, Seong-Woo; Kim, Yeong-Dae - In: European Journal of Operational Research 199 (2009) 2, pp. 375-384
We present a branch and bound algorithm for a two-machine re-entrant flowshop scheduling problem with the objective of minimizing total tardiness. In the re-entrant flowshop considered here, all jobs must be processed twice on each machine, that is, each job should be processed on machine 1,...