Artificial bee colony algorithm with genetic algorithm for job shop scheduling problem

Author(s):  
Ye Lvshan ◽  
Yuan Dongzhi ◽  
Yu Weiyu
2015 ◽  
Vol 21 (5) ◽  
pp. 1193-1202 ◽  
Author(s):  
Shyam Sundar ◽  
P. N. Suganthan ◽  
Chua Tay Jin ◽  
Cai Tian Xiang ◽  
Chong Chin Soon

2010 ◽  
Vol 26-28 ◽  
pp. 657-660 ◽  
Author(s):  
Bao Zhen Yao ◽  
Cheng Yong Yang ◽  
Juan Juan Hu ◽  
Guo Dong Yin ◽  
Bo Yu

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.


Sign in / Sign up

Export Citation Format

Share Document