An Improved Grey Wolf Optimizer for Flexible Job-shop Scheduling Problem

For the flexible job-shop scheduling problem, an optimal scheduling model with the objective of minimum completion time is established, and an improved grey wolf optimizer is proposed. The algorithm improves the coding method based on Largest Order Value rule of the grey wolf optimizer. At the same time, a local search strategy is introduced to effectively balance the exploration ability and development ability of the algorithm. Finally, experiments verify the effectiveness of the algorithm.