Applying Ant Colony Optimisation (ACO) algorithm to dynamic job shop scheduling problems
by Rong Zhou, Heow Pueh Lee, Andrew Y.C. Nee
International Journal of Manufacturing Research (IJMR), Vol. 3, No. 3, 2008

Abstract: Ant Colony Optimization (ACO) is applied to two dynamic job scheduling problems, which have the same mean total workload but different dynamic levels and disturbing severity. Its performances are statistically analysed and the effects of its adaptation mechanism and parameters such as the minimal number of iterations and the size of searching ants are studied. The results show that ACO can perform effectively in both cases; the adaptation mechanism can significantly improve the performance of ACO when disturbances are not severe; increasing the size of iterations and ants per iteration does not necessarily improve the overall performance of ACO.

Online publication date: Wed, 02-Jul-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Research (IJMR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com