中文

Journal of Applied Sciences ›› 2010, Vol. 28 ›› Issue (2): 182-188.

• Computer Science and Applications • Previous Articles     Next Articles

Improved Ant Colony Optimization Algorithm for Job Shop Scheduling Problem

  

  1. 1. Faculty of Computer Science and Engineering, Xi’an University of Technology, Xi’an 710048, China
    2. Faculty of Mechanical and Precision Instrument Engineering, Xi’an University of Technology, Xi’an 710048, China
  • Received:2009-05-21 Revised:2009-11-11 Online:2010-03-30 Published:2010-03-22
  • Supported by:

    国家“863”高技术研究发展计划基金(No. 2007AA010305)资助

PDF

1943

Cited

4

Abstract:

An improved ant colony optimization algorithm for job shop scheduling problems is proposed in this paper. The tabu list which can generate active schedule is designed. The traditional ant colony optimization algorithm is hen simplified, and a new priority rule proposed to serve as heuristic information. A local search procedure based on the neighborhood structure of job shop scheduling problem is introduced to improve convergence and solution quality of the proposed algorithm. Experiments show effectiveness of the proposed algorithm.

Key words: job shop scheduling, ant colony optimization, priority rule, neighborhood structure

CLC Number: