Minimizing earliness–tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint

Abstract

This paper considers a scheduling problem for a single burn-in oven in the semiconductor manufacturing industry where the oven is a batch processing machine with restricted capacity. The batch processing time is set by the longest processing time among those of all the jobs contained in the batch. All jobs are assumed to have the same due date. The objective is to minimize the sum of the absolute deviations of completion times from the due date (earliness–tardiness) of all jobs under the constraint that the maximum tardiness should be less than or equal to the maximum allowable time value. We suggest several two-phase heuristic algorithms for this problem. In the first phase, some heuristic algorithms are developed without maximum allowable tardiness constraint. If the schedule from the first phase violates the maximum tardiness constraint, then the schedule is changed to satisfy maximum allowable tardiness constraint in the second phase. The suggested heuristics are based on genetic algorithms and dominance properties of optimal schedules. We present the results of computational experiments that clearly show the solution quality obtained by the suggested heuristics.