Flexible Job-shop Scheduling Optimization based on Improved Gray Wolf Algorithm

Minghong Xu

doi:10.54097/w2b4af44

Authors

Minghong Xu

DOI:

https://doi.org/10.54097/w2b4af44

Keywords:

Flexible Job-shop Scheduling, GWO, Group Optimization

Abstract

This article proposed an improved gray wolf optimizer to deal with the flexible job-shop scheduling problem. By using a random key for coding job positions and adopting a local search strategy, we achieve group reconstruction and updating with the help of three good fitness values of the population, hence continuously searching for the optimal solution. Simulation experiments were conducted on a standardized test case, demonstrating the effectiveness of this method.

Downloads

Download data is not yet available.

References

Zhang, G., Hu, Y., Sun, J. (2020). Improved genetic algorithm for solving flexible job shop scheduling problem with multiple time constraints. Industrial Engineering, 19-25+48.

Lu, H. (2019). Research on flexible job shop scheduling method based on distribution estimation-ant colony hybrid algorithm. Electromechanical Engineering, 366-375.

Zhao, X., Wei, Y., Wang, K., et al. (2022). Study on flexible job shop scheduling problem with improved ant colony algorithm. Combined machine tools and automated machining technology, 02:15-22+52.

Zhang, Y., Wang, G. (2020). Improving particle swarm algorithm to solve the replacement flow shop scheduling problem. Software, 173-186.

Sevedali, E., Ruiz, R. (2014). Grey Wolf Optimizer. Advances in Engineering Software.

James, C. Bean. (1994). Genetic Algorithms and Random Keys for Sequencing and Optimization. ORSA Journal of Computing, 6(2):86-112.

Xie, F., Chen, X., Zhang, L. (2006) Realization of an effective dual-parameter sensor employing a single fibre Bragg grating structure. Optics and Lasers in Engineering, 1782-1789.

Qu, P., Tang, X. (2022) Improved particle swarm algorithm for flexible shop scheduling problem. Mechanical Design and Manufacturing, 51-58.