APPLICATION STUDY OF ANT COLONY ALGORITHM IN JOB SHOP SCHEDULING PROBLEM

摘要：

In Job Shop Scheduling Problem (JSSP), the optimal solution cannot be got through polynomial, leading to low job shop scheduling efficiency. JSSP based on ant colony algorithm is studied to improve job shop scheduling efficiency. Firstly, this algorithm has minimizing process time as the optimization objective, and the crawling path of the ant as the scheduling scheme. The optimal job shop scheduling scheme is got through cooperation and exchange between individuals in the ant colony. Experiments of job shop scheduling test show that ant colony algorithm can improve job shop scheduling efficiency and get the optimal solution within the shortest time period. It is an effective optimal algorithm of job shop scheduling.

关键词： Job shop scheduling ant colony algorithm resource constraint

作者: ZHAO HUI LI JIE

作者单位: North China Institute of Aerospace Engineering Langfang,Hebei,China,065000

会议类型: 国际会议

会议名称: 3rd International Conference on Mechanical and Electrical Technology(ICMET2011) (2011第三届机械与电气技术国际会议)

会议地点: 大连

会议语种:英文

页码: 225-229

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