The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation
Langue
en
Communication dans un congrès
Ce document a été publié dans
7th Multidisciplinary International Conference on Scheduling: Theory and Applications, 2015-08, Prague. 2015-08p. 635-637
Résumé en anglais
We consider the flowshop problem on two machines with sequence-independent setup times to minimize total completion time. Large scale network flow formulations of the problem are suggested together with strong Lagrangian ...Lire la suite >
Mots clés en anglais
Scheduling
Flowshop
Branch-and-bound
Lagrangean relaxation