Hybrid ant colony algorithm for job shop schedule with unrelated parallel machines

摘要：

　　According to the widely existing job shop schedule with unrelated parallel machines in the actual manufacturing system,a static model with minimize makespan as optimization goal was established,considering precedence,machine-dependent and sequence-dependent setup times.Since basic ant colony algorithm usually has shortcomings such as long searching time,easy trapped into local optimal solutions,this paper puts forward a hybrid ant colony algorithm adopting elite strategy and maximum and minimum ant colony mechanism.Its performance is evaluated by comparing its solutions with genetic algorithm in the literature.The results indicate the proposed algorithm significantly outperforms the competitor.

关键词： job shop unrelated parallel machines makespan ant colony algorithm

作者: Jie Zhang Guobao Liu

作者单位: State Key Laboratory of Mechanical System and Vibration, Shanghai Jiao Tong University, Shanghai 200240 P.R.China

会议类型: 国际会议

会议名称: the 2012 International Conference on Frontiers of Advanced Materials and Engineering Technology (2012年先进材料与工程技术国际会议(FAMET 2012))

会议地点: 厦门

会议语种:英文

页码: 905-908

在线出版日期: 2012-01-04（万方平台首次上网日期，不代表论文的发表时间）