Zhaolin Lv1, Yuexia Zhao2, Hongyue Kang3,*, Zhenyu Gao3, Yuhang Qin4
CMC-Computers, Materials & Continua, Vol.78, No.2, pp. 2337-2360, 2024, DOI:10.32604/cmc.2023.045826
Abstract Flexible job shop scheduling problem (FJSP) is the core decision-making problem of intelligent manufacturing production management. The Harris hawk optimization (HHO) algorithm, as a typical metaheuristic algorithm, has been widely employed to solve scheduling problems. However, HHO suffers from premature convergence when solving NP-hard problems. Therefore, this paper proposes an improved HHO algorithm (GNHHO) to solve the FJSP. GNHHO introduces an elitism strategy, a chaotic mechanism, a nonlinear escaping energy update strategy, and a Gaussian random walk strategy to prevent premature convergence. A flexible job shop scheduling model is constructed, and the static and dynamic FJSP is investigated to minimize… More >
Login
Register
