Minimising makespan in distributed assembly hybrid flowshop scheduling problems
| Year of publication: |
2025
|
|---|---|
| Authors: | Ying, Kuo-Ching ; Lin, Shih Wei ; Chen, Kuan-Fu |
| Published in: |
International journal of production research. - London [u.a.] : Taylor & Francis, ISSN 1366-588X, ZDB-ID 1485085-0. - Vol. 63.2025, 5, p. 1674-1691
|
| Subject: | assembly system | distributed hybrid flowshops | iterated espilon-greedy reinforcement learning algorithm | makespan | Scheduling | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Algorithmus | Algorithm | Fließfertigung | Assembly-line production | Evolutionärer Algorithmus | Evolutionary algorithm | Heuristik | Heuristics | Theorie | Theory |
-
Tajbakhsh, Zahra, (2014)
-
Yang, Shengluo, (2021)
-
The optimal number of used machines in a two-stage flexible flowshop scheduling problem
Gerstl, Enrique, (2014)
- More ...
-
Minimising makespan in job-shops with deterministic machine availability constraints
Lin, Shih Wei, (2021)
-
Meto-heuristic algorithms for wafer sorting scheduling problems
Lin, Shih Wei, (2011)
-
Lin, Shih Wei, (2016)
- More ...