Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1181.90021
Selvarajah, Esaignani; Steiner, George
Approximation algorithms for the supplier's supply chain scheduling problem to minimize delivery and inventory holding costs. (English)
[J] Oper. Res. 57, No. 2, 426-438 (2009). ISSN 0030-364X

Summary: We study the upstream supplier's batch scheduling problem in a supply chain, which was defined by {\it N. G. Hall} and {\it C. N. Potts} [Oper. Res. 51, No. 4, 566--584 (2003; Zbl 1165.90455)]. 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.

MSC 2000:: *90B05 Inventory management

Citations: Zbl 1165.90455

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]