Flexible job-shop scheduling study based on multi-swarm hybrid particle swarm arithmetic

Due to the complex computation and restrictive condition in flexible job-shop scheduling problem, common arithmetic can not get best solution. The article makes use of multi-swarm hybrid particle swarm arithmetic to solve the problem. Through multi-swarm evolution simultaneity and best solution concentration, the arithmetic's efficiency is increased to get better flexible job-shop scheduling. The emulation experiment shows that the arithmetic can solve flexible job-shop scheduling problem effectively.