2012 | OriginalPaper | Chapter
An Effective Artificial Bee Colony Algorithm for Multi-objective Flexible Job-Shop Scheduling Problem
Authors : Gang Zhou, Ling Wang, Ye Xu, Shengyao Wang
Published in: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper, an effective artificial bee colony (ABC) algorithm is proposed to solve the multi-objective flexible job-shop scheduling problem with the criteria to minimize the maximum completion time, the total workload of machines and the workload of the critical machine simultaneously. By using the effective decoding scheme, hybrid initialization strategy, crossover and mutation operators for machine assignment and operation sequence, local search based on critical path and population updating strategy, the exploration and exploitation abilities of ABC algorithm are stressed and well balanced. Simulation results based on some widely used benchmark instances and comparisons with some existing algorithms demonstrate the effectiveness of the proposed ABC algorithm.