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

Esaignani Selvarajah () and George Steiner ()
Additional contact information
Esaignani Selvarajah: Odette School of Business, University of Windsor, Windsor, Ontario, Canada N9B 3P4
George Steiner: Operations Management Area, DeGroote School of Business, McMaster University, Hamilton, Ontario, Canada L8S 4M4

Operations Research, 2009, vol. 57, issue 2, 426-438

Abstract: 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.

Keywords: production/scheduling; sequencing; deterministic; single machine; manufacturing; performance/productivity (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1080.0622 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:57:y:2009:i:2:p:426-438

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().