Multi-Item Inventory Systems with a Service Objective

J. Christopher Mitchell
Additional contact information
J. Christopher Mitchell: Citibank, New York, New York

Operations Research, 1988, vol. 36, issue 5, 747-755

Abstract: In this paper, we examine the problem of specifying single-item service objectives in a multi-item inventory system subject to a system wide service level constraint. We develop a computationally efficient algorithm, the Generalized Knapsack Duality (GKD) Algorithm, to find approximately optimal policies for such a system. Our computational experience with inventory systems, typical of many found in the real world, indicates that operating costs can be reduced significantly when this model is used rather than the simpler uniform service model often used in practice.

Keywords: inventory/production: multi-item inventory systems with a service objective; programming; linear: dual algorithm for locally convex program (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.36.5.747 (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:36:y:1988:i:5:p:747-755

Access Statistics for this article

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