Operations Research
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


OPERATIONS RESEARCH
Vol. 54, No. 4, July-August 2006, pp. 725-742
DOI: 10.1287/opre.1060.0313
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Humair, S.
Right arrow Articles by Willems, S. P.
Right arrow Search for Related Content

Optimizing Strategic Safety Stock Placement in Supply Chains with Clusters of Commonality

Salal Humair, Sean P. Willems

Optiant, Incorporated, 4 Van de Graaff Drive, Burlington, Massachusetts 01803
School of Management, Boston University, Boston, Massachusetts 02215

salal.humair{at}optiant.com
willems{at}bu.edu

Multiechelon inventory optimization is increasingly being applied by business users as new tools expand the class of network topologies that can be optimized. In this paper, we formalize a topology that we call networks with clusters of commonality (CoC), which captures a large class of real-world supply chains that contain component commonality. Viewed as a modified network, a CoC network is a spanning tree where the nodes in the modified network are themselves maximal bipartite subgraphs in the original network. We first present algorithms to identify these networks and then present a single-state-variable dynamic program for optimizing safety stock levels and locations. We next present two reformulations of the dynamic program that significantly reduce computational complexity while preserving the optimality of the resulting solution. This work both incorporates arbitrary safety stock cost functions and makes possible optimizing a large class of practically useful but previously intractable networks. It has been successfully applied at several Fortune 500 companies, including the recent Edelman finalist project at Hewlett Packard described in detail in Billington et al. (2004).

Subject classifications: multiechelon inventory system; safety stock optimization; dynamic programming application; component commonality; networks with clusters of commonality.
History: Received August 2003; revision received March 2005; accepted June 2005.




This article has been cited by other articles:


Home page
InterfacesHome page
J. J. Neale and S. P. Willems
Managing Inventory in Supply Chains with Nonstationary Demand
Interfaces, September 1, 2009; 39(5): 388 - 399.
[Abstract] [PDF]


Home page
MSOMHome page
S. P. Willems
Data Set--Real-World Multiechelon Supply Chains Used for Inventory Optimization
MSOM, January 1, 2008; 10(1): 19 - 23.
[Abstract] [PDF]


Home page
MSOMHome page
S. C. Graves and S. P. Willems
Strategic Inventory Placement in Supply Chains: Nonstationary Demand
MSOM, January 1, 2008; 10(2): 278 - 287.
[Abstract] [PDF]


Home page
InterfacesHome page
J. M. Bossert and S. P. Willems
A Periodic-Review Modeling Approach for Guaranteed Service Supply Chains
Interfaces, September 1, 2007; 37(5): 420 - 435.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2006 by INFORMS.