Minimising makespan in distributed mixed no-idle flowshops
Year of publication: |
2019
|
---|---|
Authors: | Cheng, Chen-Yang ; Ying, Kuo-Ching ; Chen, Hsia-Hsiang ; Lu, Hsiao-Shan |
Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 57.2019, 1, p. 48-60
|
Subject: | cloud theory-based iterated greedy algorithm | distributed mixed no-idle flowshop | makespan | metaheuristics | scheduling | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Heuristik | Heuristics | Theorie | Theory | Evolutionärer Algorithmus | Evolutionary algorithm | Algorithmus | Algorithm |
-
Lin, Shih Wei, (2014)
-
Fast heuristics for minimizing the makespan in non-permutation flow shops
Benavides, Alexander J., (2018)
-
Soares, Leonardo Cabral R., (2020)
- More ...
-
Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times
Ying, Kuo-Ching, (2023)
-
Indoor localization algorithm using clustering on signal and coordination pattern
Cheng, Chen-yang, (2014)
-
Ying, Kuo-Ching, (2012)
- More ...