Hybrid frog-leap algorithm for job shop scheduling

摘要

An improved frog-leap algorithm for job-shop scheduling is proposed. The algorithm forms frog individuals via process-based coding and utilizes the switched local search strategy to make frog individuals quickly find the minimum fitness function, thereby improving scheduling efficiency of the job shop. The proposed algorithm offers advantages, such as few parameters, simple implementation, strong global optimization ability, and dynamic balance between local and global searches. It offers means to effectively solve problems associated with job-shop scheduling.