A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
Jan Gmys, Mohand Mezmaz, Nouredine Melab, Daniel Tuyttens
| 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 | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Theorie | Theory | Computerunterstützung | Computerized method | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2020.01.039 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012238910