Title of article
Batch scheduling to minimize the weighted number of tardy jobs
Author/Authors
Erdal Erel، نويسنده , , Jay B. Ghosh، نويسنده ,
Issue Information
ماهنامه با شماره پیاپی سال 2007
Pages
7
From page
394
To page
400
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
Scheduling , Batch setup times , Dynamic programming , approximation
Journal title
Computers & Industrial Engineering
Serial Year
2007
Journal title
Computers & Industrial Engineering
Record number
925552
Link To Document