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

Boris Detienne 1, 2 Ruslan Sadykov 1, 2 Shunji Tanaka 3
1 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/hal-01419206
Contributor : Ruslan Sadykov <>
Submitted on : Monday, December 19, 2016 - 9:44:53 AM
Last modification on : Monday, November 26, 2018 - 4:12:05 PM

Identifiers

Citation

Boris Detienne, Ruslan Sadykov, Shunji Tanaka. The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation. European Journal of Operational Research, Elsevier, 2016, ⟨10.1016/j.ejor.2016.02.003⟩. ⟨hal-01419206⟩

Share

Metrics

Record views

262