We address the single-machine batch scheduling problem which arises wh
en there are job families and setup requirements exist between these f
amilies; our objective is to minimize the maximum lateness. As our mai
n result, we give an improved dynamic program for the solution of the
problem. (C) 1997 Elsevier Science B.V.