Paper Title:
An Improved Artificial Bee Colony Algorithm for Job Shop Problem
  Abstract

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, C. Y. Yang, J. J. Hu, G. D. Yin, B. Yu, "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
$32.00
Share

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

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

Authors: Wei Hua Li, Wei Jia Li, Yuan Yang, Hai Qiang Liao, Ji Long Li, Xi Peng Zheng
Digital Manufacture and Management
Abstract:By combining the modified nearest neighbor approach and the improved inver-over operation, an Artificial Bee Colony (ABC) Algorithm for...
2191
Authors: Ling Ping Jiang
Chapter 1: Mechatronics
Abstract:The problem of airline maintenance scheduling is considered in this paper. A maintenance-scheduling model that can determine rational...
147
Authors: Ho Yoong Chow, Sulaiman Hasan, Salleh Ahmad Bareduan
Abstract:Flow shop scheduling is a common operational problem in a production system. Effective flow shop scheduling can help the company to improve...
385
Authors: Xin Zhang, Guo Chu Chen
Chapter 5: Algorithms, Computation Methods and their Applications
Abstract:In view of the traditional support vector machine (SVM) model in wind power prediction parameter selection problems, this paper introduced a...
417