Solving the Flexible Job Shop Scheduling Problem Using a Discrete Improved Grey Wolf Optimization Algorithm
Xiaohong Kong, Yunhang Yao, Wenqiang Yang, Zhile Yang, Jinzhe Su
Abstract
The flexible job shop scheduling problem (FJSP) is of great importance for realistic manufacturing, and the problem has been proven to be NP-hard (non-deterministic polynomial time) because of its high computational complexity. To optimize makespan and critical machine load of FJSP, a discrete improved grey wolf optimization (DIGWO) algorithm is proposed. Firstly, combined with the random Tent chaotic mapping strategy and heuristic rules, a hybrid initialization strategy is presented to improve the quality of the original population. Secondly, a discrete grey wolf update operator (DGUO) is designed by discretizing the hunting process of grey wolf optimization so that the algorithm can solve FJSP effectively. Finally, an adaptive convergence factor is introduced to improve the global search ability of the algorithm. Thirty-five international benchmark problems as well as twelve large-scale FJSPs are used to test the performance of the proposed DIGWO. Compared with the optimization algorithms proposed in recent literature, DIGWO shows better solution accuracy and convergence performance in FJSPs at different scales.