Application of firefly algorithm for job shop scheduling

Abstract

An improved firefly algorithm is proposed for solving the job shop scheduling problem. Starting with the characteristic of job shop scheduling problem, combining disjunctive graph according to the sequence of scheduling, analyzing Scheduling options that decided by exchangeable set and alternative set, and then we can determine the optimal scheduling. Simulation results based on well-known benchmarks and comparisons with standard genetic algorithm demonstrate the effectiveness of the proposed bionic algorithm.