An Improved Artificial Bee Colony Algorithm for Job Shop Problem
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.
Zhenyu Du and Bin Liu
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