Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Solution to Multi-objective Optimization of Flow Shop Problem Based on ACO Algorithm

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

2 Author(s)
Jianfu Li ; Opto-Electron. Eng. Coll., Chongqing Univ. ; Wei Zhang

The flow shop problem with multiple objectives is always difficult to find optimal solutions, especially in large-scale problem. However, the ant colony optimization algorithms (ACO) is an effective method for solving hard combinatorial optimization problems. Therefore, we want to use the ACO algorithm to search optimal schedules of two machines flow shop problem under multi-objective constraint. Then our ACO algorithm is proposed to optimize the solutions under multi-objective constraint and the improved performance of solutions from our ACO algorithm will display in our experimental results

Published in:

Computational Intelligence and Security, 2006 International Conference on  (Volume:1 )

Date of Conference:

Nov. 2006