Batch scheduling to minimize the weighted number of tardy jobs

Batch scheduling to minimize the weighted number of tardy jobs

0.00 Avg rating0 Votes
Article ID: iaor20083019
Country: Netherlands
Volume: 53
Issue: 3
Start Page Number: 394
End Page Number: 400
Publication Date: Oct 2007
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: programming: dynamic
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.

Reviews

Required fields are marked *. Your email address will not be published.