DETIENNE, Boris; SADYKOV, Ruslan; TANAKA, Shunji

Metadatos

Licencia de uso del documento

DETIENNE, Boris
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]

TANAKA, Shunji
Institute for Liberal Arts and Sciences [Kyoto]

Idioma

Communication dans un congrès

Este ítem está publicado en

7th Multidisciplinary International Conference on Scheduling: Theory and Applications, 2015-08, Prague. 2015-08p. 635-637

Resumen en inglés

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 bounds based on these formulations. To cope with their size, filtering procedures are developed. To solve the problem to optimality, we embed the Lagrangian bounds into two branch-and- bound algorithms. The best algorithm is able to solve all 100-jobs instances of our testbed with and without setup times, thus significantly outperforming the best algorithms in the literature.< Leer menos

Palabras clave en inglés

Scheduling

Flowshop

Branch-and-bound

Lagrangean relaxation

Metadatos

Compartir este ítem

Licencia de uso del documento

The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation

Idioma

Este ítem está publicado en

Resumen en inglés

Palabras clave en inglés

URI

Orígen

Centros de investigación