The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

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

Abstract

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.
Fichier principal
Vignette du fichier
Detienne_etall_MISTA15.pdf (170.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01248318 , version 1 (24-12-2015)

Identifiers

  • HAL Id : hal-01248318 , version 1

Cite

Boris Detienne, Ruslan Sadykov, Shunji Tanaka. The two-machine flowshop total completion time problem: A branch-and-bound based on Network-flow formulation. 7th Multidisciplinary International Conference on Scheduling: Theory and Applications, Aug 2015, Prague, Czech Republic. pp.635-637. ⟨hal-01248318⟩
149 View
106 Download

Share

Gmail Facebook X LinkedIn More