Minimizing makespan and total flowtime in permutation flowshops by a bi-objective multi-start simulated-annealing algorithm
Year of publication: |
2013
|
---|---|
Authors: | Lin, Shih Wei ; Ying, Kuo-ching |
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. 40.2013, 6, p. 1625-1647
|
Subject: | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm | Heuristik | Heuristics | Operations Research | Operations research |
-
Kirlik, Gokhan, (2012)
-
Flowshop scheduling with a general exponential learning effect
Wang, Ji-bo, (2014)
-
A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
Wang, Cheng, (2012)
- More ...
-
Robust scheduling on a single machine to minimize total flow time
Lu, Chung-cheng, (2012)
-
Scheduling a bi-criteria flowshop manufacturing cell with sequence-dependent family setup times
Lin, Shih Wei, (2012)
-
Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm
Lin, Shih Wei, (2013)
- More ...