A job-shop scheduling method based on multi-agent immune algorithm

  • Authors:

  • Xinli Xu;Ping Hao;Wanliang Wang

  • Affiliations:

  • College of Information Engineering, Zhejiang University of Technology, Hangzhou;College of Information Engineering, Zhejiang University of Technology, Hangzhou;Software College, Zhejiang University of Technology, Hangzhou, China

  • Venue:
  • CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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.