Batch scheduling to minimize the weighted number of tardy jobs
Date
2007
Authors
Advisor
Instructor
Source Title
Computers and Industrial Engineering
Print ISSN
0360-8352
Electronic ISSN
1879-0550
Publisher
Pergamon Press
Volume
53
Issue
Pages
394 - 400
Language
English
Type
Article
Journal Title
Journal ISSN
Volume Title
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.
Course
Other identifiers
Book Title
Keywords
Approximation, Dynamic programming, Industrial engineering, Optimization, Polynomial approximation, Problem solving, Scheduling, Batch scheduling, Batch setup times, Tardy jobs, Job analysis