Erel, E.Ghosh, J. B.2016-02-082016-02-0820070360-8352http://hdl.handle.net/11693/23356In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family.EnglishApproximationDynamic programmingIndustrial engineeringOptimizationPolynomial approximationProblem solvingSchedulingBatch schedulingBatch setup timesTardy jobsJob analysisBatch scheduling to minimize the weighted number of tardy jobsArticle10.1016/j.cie.2007.03.0061879-0550