An Improved Artificial Bee Colony Algorithm for Job Shop Problem

Abstract:

Article Preview

Job shop scheduling problem (JSP) plays a significant role for production management and combinatorial optimization. An improved artificial bee colony (IABC) algorithm with mutation operation is presented to solve JSP in this paper. The results for some benchmark problems reveal that IABC is effective and efficient compared to those of other approaches. IABC seems to be a powerful tool for optimizing job shop scheduling problem.

Info:

Periodical:

Edited by:

Zhenyu Du and Bin Liu

Pages:

657-660

DOI:

10.4028/www.scientific.net/AMM.26-28.657

Citation:

B. Z. Yao et al., "An Improved Artificial Bee Colony Algorithm for Job Shop Problem", Applied Mechanics and Materials, Vols. 26-28, pp. 657-660, 2010

Online since:

June 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.