Ant Colony Optimisation for multi-level assembly job shop scheduling
by M. Omkumar, P. Shahabudeen
International Journal of Manufacturing Research (IJMR), Vol. 4, No. 4, 2009

Abstract: Job shop scheduling is one of the most explored areas in the last few decades. Although it is very commonly witnessed in real-life situations, very little investigation has been carried out in scheduling operations of multi-level jobs, which undergo serial, parallel, and assembly operations in an assembly job shop. In this work, some of the dispatch rules, which have best performances in scheduling multi-level jobs in a dynamic assembly job shop, are tested in static assembly job shop environment. A new optimisation heuristic based on the Ant Colony Algorithm is proposed and its performance is compared with the dispatch rules. [Received 14 July 2008; Revised 11 February 2009; Accepted 16 April 2009]

Online publication date: Fri, 18-Sep-2009

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