DocumentCode
2780492
Title
A job-shop scheduling method based on multi-agent immune algorithm
Author
Xu Xinli ; Hao Ping ; Wang WanLiang
Author_Institution
Coll. of Inf. Eng., Zhejiang Univ. of Technol., Hangzhou, China
fYear
2009
fDate
17-19 June 2009
Firstpage
2527
Lastpage
2532
Abstract
Integrating multi-agent system and the immunity information processing mechanism of immune system in biotic science, a new approach of multi-agent immune algorithm was proposed to solve job-shop scheduling problem. In term of the characteristic of job-shop scheduling problem, an agent representing a feasible solution is given. It denotes an antibody in immune algorithm. All agents live in a lattice-like environment, with each agent fixed on a lattice-point. In the method, agents compete with their neighbors, and they also use study. In addition, they can make self-adjustment of the immune responses along with the evolution of agents and they are inoculated bacteria picked up. Furthermore, it can gradually enhance the system recovery ability, and find the optimal solution with more efficiency. Simulation results show that it is an effective and efficient approach.
Keywords
job shop scheduling; multi-agent systems; optimisation; biotic science; immunity information processing mechanism; job-shop scheduling method; lattice point; multi agent immune algorithm; optimal solution; Educational institutions; Immune system; Information processing; Microorganisms; Multiagent systems; Scheduling algorithm; Software algorithms; System recovery; Immune Algorithm; Job-Shop Scheduling Problem; Multi-Agent System;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference, 2009. CCDC '09. Chinese
Conference_Location
Guilin
Print_ISBN
978-1-4244-2722-2
Electronic_ISBN
978-1-4244-2723-9
Type
conf
DOI
10.1109/CCDC.2009.5191798
Filename
5191798
Link To Document