Affiliation:
1. 1 Huzhou Vocational & Technical College , Huzhou , Zhejiang , , China .
Abstract
Abstract
The scheduling of mechanical job shops may be optimized, which is a significant approach to boosting production effectiveness. Based on the description of the job shop scheduling problem in this paper, a mathematical model is built with the objective function of minimizing the maximum completion time. The vector evaluation genetic algorithm, which samples the edge region, and the adaptation function, which completes the sampling of the core region, are both offered as improvements for the differential evolutionary algorithm focused on job shop scheduling. After the sampling has been encoded, the best scheduling solution is sought using a sequential differential strategy. The modified HEA-SDDE algorithm’s maximum completion time for the actual scheduling scenario of K’s job shop is decreased by 12.4%, and the posting rate of the best solution to the ideal solution reaches 0.516.
Subject
Applied Mathematics,Engineering (miscellaneous),Modeling and Simulation,General Computer Science
Reference19 articles.
1. Zandieh, M., Khatami, A. R., & Rahmati, S. (2017). Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Applied Soft Computing, S1568494617302429.
2. Zhang, W., Wen, J. B., Zhu, Y. C., & Hu, Y. (2017). Multi-objective scheduling simulation of flexible job-shop based on multi-population genetic algorithm. International Journal of Simulation Modelling, 16(2), 313-321.
3. Gholami, Omid, Sotskov, Yuri, & N. (2017). Mixed graph model and algorithms for parallel-machine job-shop scheduling problems. International Journal of Production Research.
4. Sang, Y., & Tan, J. (2022). Many-objective flexible job shop scheduling problem with green consideration. Energies, 15.
5. Xie, J., Li, X., Gao, L., & Gui, L. (2022). A hybrid algorithm with a new neighborhood structure for job shop scheduling problems. Computers & Industrial Engineering (Pt.2), 169.