Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment

A. K. Chakravarty, J. B. Orlin and U. G. Rothblum
Additional contact information
A. K. Chakravarty: Washington State University, Pullman, Washington
J. B. Orlin: Massachusetts Institute of Technology, Cambridge, Massachusetts
U. G. Rothblum: Yale University, New Haven, Connecticut

Operations Research, 1982, vol. 30, issue 5, 1018-1022

Abstract: We consider a problem of optimal grouping and provide conditions under which an optimal partition of an ordered set S = { r 1 , …, r n } consists of subsets of consecutive elements. We transform the problem into the problem of finding a shortest path on a directed acyclic graph with n + 1 vertices (for which efficient algorithms exist). These results may be used to solve the problem of grouping n items in stock into subgroups with a common order cycle per group so as to minimize the resulting economic order quantity costs.

Keywords: 331 optimal inventory groupings for joint replenishment; 625 a partitioning problem with additive objective (search for similar items in EconPapers)
Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (16)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.30.5.1018 (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:30:y:1982:i:5:p:1018-1022

Access Statistics for this article

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