On some lower bounds for the permutation flowshop problem
Year of publication: |
2023
|
---|---|
Authors: | Cáceres Gelvez, Sebastian ; Thu Huong Dang ; Letchford, Adam N. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 159.2023, p. 1-9
|
Subject: | Flowshop scheduling | Lower bounds | Permutation flowshops | Scheduling-Verfahren | Scheduling problem | Evolutionärer Algorithmus | Evolutionary algorithm | Heuristik | Heuristics | Durchlaufzeit | Lead time | Mathematische Optimierung | Mathematical programming |
-
Matin, Hossein N. Z., (2017)
-
Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems
Keshavarz, Taha, (2014)
-
Naderi, B., (2014)
- More ...
-
Vehicle routing on road networks : how good is Euclidean approximation?
Boyaci, Burak, (2021)
-
Changing foreign direct investment climate in Vietnam
Dang Thu Huong, (2005)
-
On the complexity of surrogate and group relaxation for integer linear programs
Dokka, Trivikram, (2021)
- More ...