This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via Google Scholar Google Scholar Articles by Selvarajah, E. Articles by Steiner, G. Search for Related Content

Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs

Odette School of Business, University of Windsor, Windsor, Ontario, Canada N9B 3P4
Operations Management Area, DeGroote School of Business, McMaster University, Hamilton, Ontario, Canada L8S 4M4
selvare{at}uwindsor.ca
steiner{at}univmail.cis.mcmaster.ca

We study the upstream supplier's batch scheduling problem in a supply chain, which was defined by Hall and Potts [Hall, N. G., C. N. Potts. 2003. Supply chain scheduling: Batching and delivery. Oper. Res. 51(4) 566–584]. The supplier has to manufacture multiple products and deliver them to customers in batches. There is an associated delivery cost with each batch. The objective of the supplier is to minimize the total inventory holding and delivery costs. We present simple approximation algorithms for this strongly NP-hard problem, which find a solution that is guaranteed to have a cost at most 3/2 times the minimum. We also prove that the approximation algorithms have worst-case bounds that vary parametrically with the data and that for realistic parameter values are much better than 3/2. The theoretical results are also supported by the findings of a computational study.

Subject classifications: production/scheduling; sequencing; deterministic; single machine; manufacturing; performance/productivity.
History: Received May 2005; revision received November 2007; accepted January 2008.