The distributed permutation flowshop scheduling problem
Year of publication: |
2010
|
---|---|
Authors: | Naderi, Bahman ; Ruiz, Rubé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. 37.2010, 4, p. 754-768
|
Subject: | Scheduling-Verfahren | Scheduling problem | Evolutionärer Algorithmus | Evolutionary algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic
M'Hallah, Rym, (2012)
-
An efficient iterated local search algorithm for the total tardiness blocking flow shop problem
Ribas, Imma, (2013)
-
Cell loading and family scheduling for jobs with individual due dates to minimise maximum tardiness
Süer, Grüsel A., (2014)
- More ...
-
Algorithms for a realistic variant of flowshop scheduling
Naderi, Bahman, (2010)
-
A scatter search algorithm for the distributed permutation flowshop scheduling problem
Naderi, Bahman, (2014)
-
Iterated Greedy methods for the distributed permutation flowshop scheduling problem
Ruiz, Rubén, (2019)
- More ...