SCHEDULING A SINGLE BATCH PROCESSING MACHINE WITH SECONDARY RESOURCE CONSTRAINTS

This paper studies the problems of minimizing total completion time (S igma C-i) and makespan (Cmax) on a single batch processing machine wit h job families and secondary resource constraints. The motivation for this problem is the burn-in operation in the final testing stage of se miconductor manufacturing, where both oven capacity and the number of boards available may constrain scheduling decisions. Because both prob lems are NP-hard, integer programming formulations are developed for s pecial cases and are then used to develop heuristics. Extensive comput ational experiments show that the heuristics are capable of consistent ly obtaining good solutions in modest CPU times.