Scheduling with agreeable release times and due dates on a batch processing machine

We consider the problem of scheduling semiconductor burn-in operations, where burn-in ovens are modeled as batch processing machines. The job release times and due dates are assumed to be agreeable. Two different objective functions are considered: minimize the maximum tardiness and minimize the number of tardy jobs. We study the complexity of the problems. Efficient algorithms are also provided for the case when the job release times, due dates, and processing times are agreeable, which generalize those provided by Lee et al..