Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Year of publication: |
2013
|
---|---|
Authors: | Lin, Shih Wei ; Ying, Kuo-ching ; Huang, Chien-yi |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 16 (15.8.), p. 5029-5038
|
Subject: | scheduling | distributed permutation flowshop | modified iterated greedy algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Theorie | Theory | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm |
-
Fernandez-Viagas, Victor, (2015)
-
Nouri, Behdin Vehedi, (2013)
-
Two-machine flowshop scheduling with a truncated learning function to minimize the makespan
Cheng, T. C. E., (2013)
- More ...
-
Lin, Shih Wei, (2013)
-
Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm
Lin, Shih-Wei, (2013)
-
Robust scheduling on a single machine to minimize total flow time
Lu, Chung-cheng, (2012)
- More ...