A chaotic simulated annealing and particle swarm improved artificial immune algorithm for flexible job shop scheduling problem

Abstract

Abstract Reasonable scheduling of flexible job shop is key to improve production efficiency and economic benefits; in order to solve the problem in flexible job shop scheduling problem, a novel flexible job shop scheduling method based on improved artificial immune algorithm is proposed. Firstly, a mathematical model of the flexible job shop scheduling is established, and the total shortest processing time is taken as the objective function. Secondly, artificial immune algorithm is used to solve the problem, and particle swarm optimization algorithm is taken as the operator to embed into manual immune algorithm for maintaining the diversity of population and prevent obtaining local optimal solution. Finally, the performance of the algorithm is tested by simulation experiments on standard set. The results show that the proposed algorithm can obtain better flexible job shop scheduling scheme and especially has more significant advantages in solving large-scale problems in comparison with other algorithms.

Keywords

• Flexible job shop scheduling
• Artificial immune algorithm
• Mutation operator
• Particle swarm optimization algorithm