A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
We consider the single machine, serial batching scheduling problem 1|prec;pj=p;s-batch;rj|Lmax. The complexity of this problem is reported as open in the literature. By reducing this problem to the version without precedence constraints, we show that the problem is polynomially solvable.
batches scheduling precedence constraints