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.