A Novel Hybrid Whale Optimization Algorithm for Flexible Job-Shop Scheduling Problem

The flexible job shop scheduling problem (FJSP) is an extension of the classical and one more well-known NP-hard problems. To get better global optima FJSP, a novel hybrid whale optimization algorithm (HWOA) proposed for solving in which minimizing makespan considered as objective. Firstly, uniformity extensiveness initial population distribution are increased with good point set (GPS). Secondly, new nonlinear convergence factor (NCF) coordinating weight local search. Then, multi-neighborhood structure (MNS) proposed, within total three neighborhoods used to search optimal solution from different directions. Finally, diversity reception mechanism (DRM), ensures some extent that preserved iteration, presented. Seven international benchmark functions test performance HWOA, results show HWOA efficient. applied 73 FJSP four Ra instances scales flexibility, further verify effectiveness superiority HWOA.