Skip to Main Content
ASME Press Select Proceedings

International Conference on Mechanical and Electrical Technology, 3rd, (ICMET-China 2011), Volumes 1–3

By
Yi Xie
Yi Xie
Search for other works by this author on:
ISBN:
9780791859810
No. of Pages:
906
Publisher:
ASME Press
Publication date:
2011

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.

This content is only available via PDF.
Close Modal
This Feature Is Available To Subscribers Only

Sign In or Create an Account

Close Modal
Close Modal