An improved memetic algorithm based on a dynamic neighbourhood for the permutation flowshop scheduling problem
| Year of publication: |
2014
|
|---|---|
| Authors: | Xu, Jianyou ; Yin, Yunqiang ; Cheng, T. C. E. ; Wu, Chin-chia ; Gu, Shusheng |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 52.2014, 4 (15.2.), p. 1188-1199
|
| Subject: | permutation flowshop scheduling | discrete particle swarm optimisation | self-adaptive diversity control | makespan | total flowtime | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Evolutionärer Algorithmus | Evolutionary algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics |
-
Anjana, V., (2020)
-
A review and classification on distributed permutation flowshop scheduling problems
Perez-Gonzalez, Paz, (2024)
-
Minimising makespan in distributed assembly hybrid flowshop scheduling problems
Ying, Kuo-Ching, (2025)
- More ...
-
Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
Yin, Yunqiang, (2017)
-
Wasserstein distributionally robust chance-constrained program with moment information
Luo, Zunhao, (2023)
-
Due date assignment and scheduling on a single machine with two competing agents
Wang, Du-Juan, (2016)
- More ...