By Topic

Ant colony optimization with local search applied to the Flexible Job Shop Scheduling Problems

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

4 Author(s)
De-lin Luo ; Dept. of Autom., Xiamen Univ., Xiamen ; Shun-xiang Wu ; Mao-qing Li ; Zhong Yang

Flexible job-shop scheduling problem known as FJSSP is a NP-hard problem which attracts great attentions from researchers for decades. In this paper, a new approach of ant colony optimization with local search (ACOLS) is presented to solve the FJSSP. In the ACOLS, a new heuristic information is designed to balance the workloads between machines while ants tend to select the machine with less processing time for those operations. SPT scheduling rule is used to sequence the operations on each machine. In each iteration, a designed local search is used to search the neighborhood of the optimal solution obtained in each iteration for possible better solutions by the criterions of less total workloads and their variance for all machines. Simulation results show that the proposed ACOLS is very efficient compared with the basic ACO and other algorithms to deal with FJSSP.

Published in:

Communications, Circuits and Systems, 2008. ICCCAS 2008. International Conference on

Date of Conference:

25-27 May 2008