Author:
Gao Yi-Jie,Shang Qing-Xia,Yang Yuan-Yuan,Hu Rong,Qian Bin
Publisher
Springer Nature Singapore
Reference16 articles.
1. Brandimarte, P.: Routing and scheduling in a flexible job shop by tabu search. Ann. Oper. Res. 41(1–4), 57–183 (1993)
2. Xing, L.-N., Chen, Y.-W., Wang, P., Zhao, Q.-S., Xiong, J.: A knowledge-based ant colony optimization for flexible job shop scheduling problems. Applied Soft Computing 10(3), 888–896 (2010)
3. Cui, Y.W., Yang, L.I., Xinyu, L.I.: Solving flexible job shop scheduling problem by a multi-swarm collaborative genetic algorithm. J. Syst. Eng. Electron. 32(02), 261–271 (2021)
4. Bonyadi, M.R., Michalewicz, Z.: Analysis of stability, local convergence, and transformation sensitivity of a variant of the particle swarm optimization algorithm. IEEE Trans. Evol. Comput. 20(3), 370–385 (2016)
5. Tang, K.X., Liang, X.L., Zhou, W.F., et al.: Dynamic multi-population particle swarm optimization algorithm with recombined learning and hybrid mutation. Control and Decision 36(12), 2871–2880 (2021)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献