A branch-and-bound algorithm for the two-machine total completion time flowshop problem subject to release dates
Year of publication: |
2020
|
---|---|
Authors: | Rakrouki, Mohamed Ali ; Kooli, Anis ; Chalghoumi, Sabrine ; Ladhari, Talel |
Published in: |
Operational research : an international journal. - Berlin : Springer, ISSN 1866-1505, ZDB-ID 2425760-6. - Vol. 20.2020, 1, p. 21-35
|
Subject: | Flowshop | Release dates | Total completion time | Branch-and-bound | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Heuristik | Heuristics |
-
Detienne, Boris, (2016)
-
On the exact bounds of SPT for scheduling on parallel machines with availability constraints
Tan, Zhiyi, (2013)
-
Krishnaraj, J., (2012)
- More ...
-
Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop
Ladhari, Talel, (2009)
-
Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop
Ladhari, Talel, (2009)
-
Heuristics and lower bounds for minimizing the total completion time in a two-machine flowshop
Ladhari, Talel, (2009)
- More ...