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 |
-
Fernandez-Viagas, Victor, (2017)
-
Distributed permutation flowshop scheduling problem with total completion time objective
Ali, Arshad, (2021)
-
Metaheuristics for the permutation flowshop problem with a weighted quadratic tardiness objective
Silva, Andreia F., (2022)
- More ...
-
Supply chain-oriented permutation flowshop scheduling considering flexible assembly and setup times
Ying, Kuo-Ching, (2023)
-
Chen, Yin-Yann, (2013)
-
An efficient hybrid algorithm for integrated order batching, sequencing and routing problem
Chen, Tzu-Li, (2015)
- More ...