Improved Whale Optimization Algorithm for Solving Flexible Job Shop Scheduling Problem
REN Yongfeng
WANG Chengqun
Abstract：In this paper,an improved whale optimization algorithm is proposed to solve the maximum completion time prob-lem of flexible job shop scheduling.ROV value mapping is used to map machine selection and job scheduling to the continuous opti-mization algorithm,and the Tent chaos strategy is used to initialize the population at the initialization stage,based on WOA,the nonlinear control theory parameter balanced global search and local search are introduced,the Lévy flight strategy is also introduced to expand the population exploration space,and the TS is embedded in the update phase of WOA to enhance the local search capa-bility.Finally,the improved whale optimization algorithm is proven to be able to find a better solution by testing a standard example of a flexible workshop.
Keywords：Lévy flight strategywhale optimization algorithmtabu searchflexible job shop scheduling
Publication Date：2025-12-20
Online Publishing Date：2026-03-09(First online date of this platform, not the publication date of the document)
Pages：6( 3424-3428,3488 )