Tabu search methods for scheduling a burn-in oven with non-identical job sizes and secondary resource constraints (Q2427728)

Summary: 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.