The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation - Detienne, Boris; Sadykov, Ruslan; Tanaka, Shunji (European Journal of Operational Research, 2016)
Keywords: [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC]; [INFO.INFO-RO]Computer Science [cs]/Operations Research [cs.RO]; Algorithms; Branch & bound algorithms; Branch-and-bound; Completion time; Computer Science; Filtering; Filtration; Flowshop; Formulations; Job shops; Lagrange multiplier; Lagrangian relaxation; Network flow problem; Operational research; Operations Research; Optimization; Optimization algorithms; Production management; Scheduling; Setup times; Studies; Branch-and-bound; Scheduling; Flowshop; Lagrangian relaxation