By Topic

Solving permutation flow shop sequencing using ant colony optimization

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)
Ahmadizar, F. ; Iran Univ. of Sci. & Technol., Tehran ; Barzinpour, F. ; Arkat, J.

This paper proposes an ant colony algorithm for permutation flow shop scheduling problem. The objective considered is to minimize makespan. Two priority rules are developed as heuristic information based on Johnson's Rule and total processing times. A local search is used for improving the constructed solutions. The proposed ant colony algorithm is tested on the benchmark problem set of Taillard. The obtained results are compared with the previous implementations of ant colony optimization which are available in the literature. Computational results show that the proposed algorithm performs better than other algorithms when the number of machines is less than ten.

Published in:

Industrial Engineering and Engineering Management, 2007 IEEE International Conference on

Date of Conference:

2-4 Dec. 2007