Article ID: | iaor20052413 |
Country: | Netherlands |
Volume: | 135 |
Issue: | 1 |
Start Page Number: | 41 |
End Page Number: | 64 |
Publication Date: | Mar 2005 |
Journal: | Annals of Operations Research |
Authors: | Hall Nicholas G., Potts Chris N. |
Keywords: | scheduling, programming: dynamic |
This paper considers several scheduling problems where deliveries are made in batches with each batch delivered to the customer in a single shipment. Various scheduling costs, which are based on the delivery times of the jobs, are considered. The objective is to minimize the scheduling cost plus the delivery cost, and both single and parallel machine environments are considered. For many combinations of these, we either provide efficient algorithms that minimize total cost or show that the problem is intractable. Our work has implications for the coordination of scheduling with batch delivery decisions to improve customer service.