Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints
by Chandra Sen Mazumdar, M. Mathirajan, R. Gopinath, A.I. Sivakumar
International Journal of Operational Research (IJOR), Vol. 3, No. 1/2, 2008

Abstract: In this paper, we consider the problem of scheduling semiconductor burn-in operation, where the burn-in oven is modelled as a batch processing machine. In this study, both oven capacity and the number of boards available are taken as constraints. The objective measure of the problem is minimising the total completion time of all jobs. The computational difficulty in getting optimal solution is shown empirically. Since the problem under study is NP-hard, two variants of Tabu Search method are proposed. A series of computational experiments show that the proposed variants of Tabu Search method outperforms the existing heuristic for most system configurations in very meagre CPU times on P4 machine.

Online publication date: Fri, 07-Dec-2007

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 Operational Research (IJOR):
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