A chaotic simulated annealing and particle swarm improved artificial immune algorithm for flexible job shop scheduling problem
Rui Zeng, Yingyan Wang
EURASIP Journal on Wireless Communications and Networking · 2018
doi:10.1186/s13638-018-1109-2 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.