Batch scheduling to minimize the weighted number of tardy jobs
Date
2007Source Title
Computers and Industrial Engineering
Print ISSN
0360-8352
Electronic ISSN
1879-0550
Publisher
Pergamon Press
Volume
53
Pages
394 - 400
Language
English
Type
ArticleItem Usage Stats
252
views
views
205
downloads
downloads
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
ApproximationDynamic programming
Industrial engineering
Optimization
Polynomial approximation
Problem solving
Scheduling
Batch scheduling
Batch setup times
Tardy jobs
Job analysis