Minimising makespan for single burn-in oven scheduling problems using ACO+DP approach
by Hao Shao, Hua-ping Chen
International Journal of Manufacturing Research (IJMR), Vol. 5, No. 3, 2010

Abstract: This paper considers minimising makespan on a single batch processing machine where jobs have dynamic release time and non-identical sizes in burn-in operation of semiconductor final testing. The machine can process one batch at a time as long as its capacity is not exceeded. The processing time of a batch equals to the longest processing time of all jobs in that batch. The problem is proven to be NP-hard and hence a hybrid Ant Colony Optimisation (ACO) method was proposed combined with Dynamic Programming (DP) technique. Computational results show that the joint ACO+DP approach performs considerably well on all instances. [Received 9 April 2009; Revised 27 June 2009; Accepted 13 October 2009]

Online publication date: Wed, 02-Jun-2010

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