The two-machine flowshop total completion time problem : branch-and-bound algorithms based on network-flow formulation
Year of publication: |
1 August 2016
|
---|---|
Authors: | Detienne, Boris ; Sadykov, Ruslan ; Tanaka, Shunji |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 252.2016, 3 (1.8.), p. 750-760
|
Subject: | Scheduling | Flowshop | Branch-and-bound | Lagrangian relaxation | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound | Heuristik | Heuristics | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Ozturk, Onur, (2017)
-
Gmys, Jan, (2020)
-
Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
Jafari-Nodoushan, Abbasali, (2021)
- More ...
-
Detienne, Boris, (2014)
-
Lagrangian domain reductions for the single machine earliness-tardiness problem with release dates
Detienne, Boris, (2010)
-
Cut generation for an employee timetabling problem
Detienne, Boris, (2009)
- More ...