Parallel batch scheduling of equal-length jobs with release and due dates

In this paper we study parallel batch scheduling problems with bounded batch capacity and equal-length jobs in a single and parallel machine environment. It is shown that the feasibility problem 1|p-batch,b<n,rj,pj=p,Cj≤dj|− can be solved in O(n2) time and that the problem of minimizing the maximum lateness can be solved in O(n2log n) time. For the parallel machine problem P|p-batch,b<n,rj,pj=p,Cj≤dj|− an O(n3log n)-time algorithm is provided, which can also be used to solve the problem of minimizing the maximum lateness in O(n3log 2n) time.