By Topic

Flexible job shop scheduling problems by a hybrid artificial bee colony 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

3 Author(s)
Junqing Li ; Sch. of Comput., Liaocheng Univ., Liaocheng, China ; Quanke Pan ; Shengxian Xie

In this paper, an effective artificial bee colony (ABC) algorithm is proposed for solving the flexible job shop scheduling problems. The total flow time criterion was considered. In the proposed algorithm, tabu search (TS) heuristic is introduced to perform local search for employed bee, onlookers, and scout bees. Meanwhile, an external Pareto archive set is employed to record enough non-dominated solutions for the problem considered. Experimental results on five well-known benchmarks show the efficiency of the proposed hybrid algorithm. It is concluded that the proposed algorithm is superior to the very recent algorithms in term of both search quality and computational efficiency.

Published in:

Evolutionary Computation (CEC), 2011 IEEE Congress on

Date of Conference:

5-8 June 2011