A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
Year of publication: |
2020
|
---|---|
Authors: | Gmys, Jan ; Mezmaz, Mohand ; Melab, Nouredine ; Tuyttens, Daniel |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 284.2020, 3 (1.8.), p. 814-833
|
Subject: | Branch-and-Bound | Flowshop | Makespan | Parallel computing | Scheduling-Verfahren | Scheduling problem | Branch and Bound | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Computerunterstützung | Computerized method | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Detienne, Boris, (2016)
-
Ozturk, Onur, (2017)
-
Rakrouki, Mohamed Ali, (2020)
- More ...
-
Gmys, Jan, (2022)
-
Heuristics for exact nonnegative matrix factorization
Gillis, Nicolas, (2015)
-
Metaheuristics in multiple objective optimization
Jaszkiewicz, Andrzej, (2006)
- More ...