Hu Kongfu, Wang Lei, Cai Jingcao, Cheng Long
School of Mechanical Engineering, Anhui Polytechnic University, Wuhu 241000, China.
AnHui Key Laboratory of Detection Technology and Energy Saving Devices, AnHui Polytechnic University, Wuhu 241000, China.
Math Biosci Eng. 2023 Sep 11;20(9):17407-17427. doi: 10.3934/mbe.2023774.
The job shop scheduling problem (JSP) has consistently garnered significant attention. This paper introduces an improved genetic algorithm (IGA) with dynamic neighborhood search to tackle job shop scheduling problems with the objective of minimization the makespan. An inserted operation based on idle time is introduced during the decoding phase. An improved POX crossover operator is presented. A novel mutation operation is designed for searching neighborhood solutions. A new genetic recombination strategy based on a dynamic gene bank is provided. The elite retention strategy is presented. Several benchmarks are used to evaluate the algorithm's performance, and the computational results demonstrate that IGA delivers promising and competitive outcomes for the considered JSP.
作业车间调度问题（JSP）一直备受关注。本文介绍了一种带有动态邻域搜索的改进遗传算法（IGA），以解决作业车间调度问题，目标是最小化完工时间。在解码阶段引入了基于空闲时间的插入操作。提出了一种改进的部分映射交叉（POX）交叉算子。设计了一种新颖的变异操作来搜索邻域解。提供了一种基于动态基因库的新遗传重组策略。提出了精英保留策略。使用几个基准测试来评估算法的性能，计算结果表明IGA对于所考虑的JSP给出了有前景且具有竞争力的结果。
