Evolving Dispatching Rules in Improved BWO Heuristic Algorithm for Job-Shop Scheduling.

In this paper, an improved Beluga Whale Optimization algorithm based on data mining and scheduling rules with AdaBoost(IBWO-DDR-AdaBoost) rule heuristic scheduling method for solving job-shop scheduling problems (JSP) is proposed, in which data mining-extracted dispatching rules are incorporated into the heuristic algorithm to guide the optimization process. Firstly, an AdaBoost-CART integrated learning algorithm is introduced to evolve dispatching knowledge from historical data and convert it into effective dispatching rules. Secondly, in order to address the issues of local optimality and slow convergence speed faced by the beluga whale optimization algorithm (BWO) when solving JSP, this study presents an improved beluga whale optimization algorithm (IBWO) that incorporates two enhancement mechanisms: a neighborhood search strategy based on greedy thinking and genetic operators. These enhancements aim to improve both the efficiency and quality of reconciliation in scheduling, ultimately leading to better scheduling schemes. Furthermore, the extracted scheduling rules obtained through the AdaBoost-CART integrated learning algorithm are embedded into the improved beluga optimization algorithm, enabling real-time solution updates for optimized schedules. Finally, extensive simulation tests are conducted on JSP benchmark examples of varying scales with minimizing maximum completion time as the objective function for schedule optimization. The simulation results demonstrate the significant advantages of our proposed IBWO-DDR-AdaBoost rule heuristic scheduling method in terms of accuracy, performance optimization, and convergence speed. [ABSTRACT FROM AUTHOR]