Ghosh, J. B.Gupta, J. N. D.2015-07-282015-07-2819970167-6377http://hdl.handle.net/11693/11068We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, we give an improved dynamic program for the solution of the problem.EnglishAnalysis of algorithmsDynamic programmingProductionSchedulingBatch scheduling to minimize maximum latenessArticle10.1016/S0167-6377(97)00028-X