Multi-agent based genetic algorithm for JSSP

A novel multi-agent based on genetic algorithm (GA) is proposed to solve job-shop scheduling problem (JSSP). This algorithm not only can accelerate the creation of initial population and the selection of evaluation population, but also can control the processing of selection, crossover and mutation in an intelligent way. Job-shop benchmarks are used to evaluate the efficiency and performance of the proposed algorithm. The experimental result shows it has better optimal performance.