Single machine unbounded parallel-batch scheduling with forbidden intervals

In this paper we consider the single machine parallel-batch scheduling with forbidden intervals. There are some forbidden intervals in which the machine cannot be available. The jobs are processed in batches form in the remaining free time-slots without preemption, where the processing time of a batch is defined to be the maximum processing time of the jobs in this batch. We show that, when the objective is bottleneck form, maximum lateness, or makespan with release dates of jobs, the considered problem can be solved in polynomial time.