Equilibrium Optimizer and Slime Mould Algorithm with Variable Neighborhood Search for Job Shop Scheduling Problem
Job Shop Scheduling Problem (JSSP) is a well-known NP-hard combinatorial optimization problem.In recent years, many scholars have proposed various metaheuristic algorithms to solve JSSP, playing an important role in solving small-scale JSSP.However, when the size of the problem increases, the algorithms usually take too much time to converge.In thi