Batch Scheduling to minimize the weighted number of tardy jobs
Ghosh, J. B.
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/13553
Computers and Industrial Engineering
- Department of Management 
In 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. 2007 Elsevier Ltd. All rights reserved.
Erel, E., & Ghosh, J. B. (2007). Batch scheduling to minimize the weighted number of tardy jobs. Computers & Industrial Engineering, 53(3), 394-400.