Article ID: | iaor201111674 |
Volume: | 191 |
Issue: | 1 |
Start Page Number: | 171 |
End Page Number: | 181 |
Publication Date: | Nov 2011 |
Journal: | Annals of Operations Research |
Authors: | Steiner George, Zhang Rui |
Keywords: | scheduling, allocation: resources, programming: dynamic |
We study a supply chain scheduling problem, where a common due date is assigned to all jobs and the number of jobs in delivery batches is constrained by the batch size. Our goal is to minimize the sum of the weighted number of tardy jobs, the due‐date‐assignment costs and the batch‐delivery costs. We show that some well‐known