An Improved Harris Hawks Optimization Algorithm for Solving the Permutation Flow Shop Scheduling Problem


  • Xiaoyu Li



Permutation flow shop scheduling problem, Harris Hawks optimization, Minimize makespan


In this paper, an improved Harris Hawks optimization algorithm is proposed to solve the permutation flow shop scheduling problem with the objective of minimizing the completion time. Logistic chaotic mapping and inverse learning strategy are used to generate a high-quality initial population. A golden sine algorithm is introduced to improve the position update method. A nonlinear escape energy factor and adaptive t-distribution strategy are introduced to solve the problem of imbalance between the exploration and exploitation phases of the HHO algorithm. The effectiveness of the improved Harris Hawks optimization algorithm is verified by testing it on the Reeves benchmark test set and comparing it with other algorithms.


Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Proceedings of ICNN'95-international conference on neural networks (Vol. 4, pp. 1942-1948). ieee.

Holland, J. H. (1992). Genetic algorithms. Scientific american, 267(1), 66-73.

Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: optimization by a colony of cooperating agents. IEEE transactions on systems, man, and cybernetics, part b (cybernetics), 26(1), 29-41.

Heidari, A. A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., & Chen, H. (2019). Harris hawks optimization: Algorithm and applications. Future generation computer systems, 97, 849-872.

Mahapatra, S., Dey, B., & Raj, S. (2021). A novel ameliorated Harris hawk optimizer for solving complex engineering optimization problems. International Journal of Intelligent Systems, 36(12), 7641-7681.

Qu, C., He, W., Peng, X., & Peng, X. (2020). Harris hawks optimization with information exchange. Applied mathematical modelling, 84, 52-75.

Gupta, S., Deep, K., Heidari, A. A., Moayedi, H., & Wang, M. (2020). Opposition-based learning Harris hawks optimization with advanced transition rules: principles and analysis. Expert Systems with Applications, 158, 113510.

Deng, G., & Gu, X. (2012). A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion. Computers & Operations Research, 39(9), 2152-2160.

Tasgetiren, M. F., Sevkli, M., Liang, Y. C., & Gençyilmaz, G. (2004). Particle swarm optimization algorithm for single machine total weighted tardiness problem. In Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753) (Vol. 2, pp. 1412-1419). IEEE.

Zhang, X., & Zhou, H. . (2016). Variable parameters quantum-inspired evolutionary algorithm and its application in permutation flow-shop scheduling problem. Computer Integrated Manufacturing Systems.

Liu, Y., Yin, M., & Gu, W. (2014). An effective differential evolution algorithm for permutation flow shop scheduling problem. Applied Mathematics and Computation, 248, 143-159.

Tseng, L. Y., & Lin, Y. T. (2010). A hybrid genetic algorithm for no-wait flowshop scheduling problem. International journal of production economics, 128(1), 144-152.







How to Cite

Li, X. (2024). An Improved Harris Hawks Optimization Algorithm for Solving the Permutation Flow Shop Scheduling Problem. Journal of Computing and Electronic Information Management, 12(3), 89-93.

Similar Articles

1-10 of 43

You may also start an advanced similarity search for this article.