Tabu Search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints

Chandra Sen Mazumdar, M. Mathirajan, R. Gopinath and A.I. Sivakumar

International Journal of Operational Research, 2008, vol. 3, issue 1/2, 119-139

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.

Keywords: batch processing machines; burn-in oven; scheduling; secondary resource constraints; Tabu search; total completion time; job sizes; resource constraints; operational research; semiconductor manufacturing. (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.inderscience.com/link.php?id=16157 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:3:y:2008:i:1/2:p:119-139

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().