Article ID Journal Published Year Pages File Type
1135689 Computers & Industrial Engineering 2007 7 Pages PDF
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering Engineering Industrial and Manufacturing Engineering
Preview
Batch scheduling to minimize the weighted number of tardy jobs
Authors
, ,