An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops
Year of publication: |
2008
|
---|---|
Authors: | Liaw, Ching-Fang |
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. 35.2008, 10, p. 3276-3283
|
Subject: | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Durchlaufzeit | Lead time |
-
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 ...
-
Scheduling preemptive open shops to minimize total tardiness
Liaw, Ching-Fang, (2005)
-
A hybrid genetic algorithm for the open shop scheduling problem
Liaw, Ching-Fang, (2000)
-
An iterative improvement approach for the nonpreemptive open shop scheduling problem
Liaw, Ching-Fang, (1998)
- More ...