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 | Branch-and-Bound | Branch and Bound | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Heuristik | Heuristics | Mathematische Optimierung | Mathematical programming | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Krishnaraj, J., (2012)
-
Wang, Jian-Jun, (2015)
-
Fernandez-Viagas, Victor, (2014)
- More ...
-
Detienne, Boris, (2014)
-
A heuristic algorithm based on Lagrangian relaxation for the closet string problem
Tanaka, Shunji, (2012)
-
Sadykov, Ruslan, (2012)
- More ...