By Topic

A modified Ant Colony algorithm for the Job Shop Scheduling Problem to minimize makespan

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhiqiang Zhang ; Fac. of Comput. Sci. & Eng., Xi''an Univ. of Technol., Xi''an, China ; Jing Zhang ; Shujuan Li

This paper presents a modified Ant Colony Optimization (ACO) algorithm for the Job Shop Scheduling Problem (JSSP) with makespan criterion. The traditional ACO algorithms can be simplified with the elimination of pheromone unimportant to the JSSP solution. Also, this paper suggests a new priority rule served as the heuristic information of the proposed algorithm. In order to improve the convergence and solution qualities of the proposed algorithm, the local search procedure based on the neighborhood of the JSSP is introduced. The experimental results indicate that the modified ACO algorithm in this paper is more concise and more effective than ACO algorithms. Furthermore, this paper discloses the existing problems of ACO algorithms for the JSSP.

Published in:

Mechanic Automation and Control Engineering (MACE), 2010 International Conference on

Date of Conference:

26-28 June 2010