Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
Year of publication: |
2009
|
---|---|
Authors: | Zobolas, G. I. ; Tarantilis, C. D. ; Ioannou, G. |
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. 36.2009, 4, p. 1249-1267
|
Subject: | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Theorie | Theory |
-
Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic
M'Hallah, Rym, (2012)
-
Effective meta-heuristics for scheduling on uninform machines with resource-dependent release dates
Li, Kai, (2015)
-
Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families
Cakici, Eray, (2013)
- More ...
-
A hybrid evolutionary algorithm for the job shop scheduling problem
Zobolas, G. I., (2009)
-
Paraskevopoulos, D. C., (2008)
-
A hybrid evolution strategy for the open vehicle routing problem
Repoussis, P. P., (2010)
- More ...