|
||||
|
||||
Inventory Management of a Fast-Fashion Retail Network
Felipe Caro University of California, Los Angeles - Anderson School of Management Jérémie Gallien MIT Sloan School of Management August 2, 2007 MIT Sloan Research Paper No. 4656-07 Abstract: Working in collaboration with Spain-based retailer Zara, we address the problem of distributing over time a limited amount of inventory across all the stores in a fast-fashion retail network. Challenges specific to that environment include very short product life-cycles, and store policies whereby a reference is removed from display whenever one of its key sizes stocks out. We first formulate and analyze a stochastic model predicting the sales of a reference in a single store during a replenishment period as a function of demand forecasts, the inventory of each size initially available and the store inventory management policy just stated. Secondly, we formulate a mixed-integer program embedding a piece-wise linear approximation of the first model applied to every store in the network and allowing to compute store shipment quantities maximizing overall predicted sales, subject to inventory availability and other constraints. We report the implementation of this optimization model by Zara to support its inventory distribution process, and the ensuing controlled field experiment performed to assess the impact of that model relative to the prior procedure used to determine weekly shipment quantities. The results of that experiment suggest that the new allocation process tested increases sales, reduces tran-shipments, and increases the proportion of time that an important category of Zara's products spends on display.
Keywords: inventory management, retail network Working Paper SeriesDate posted: August 15, 2007 ; Last revised: October 29, 2007Suggested CitationContact Information
|
|
||||||||||||||||||||||
© 2009 Social Science Electronic Publishing, Inc. All Rights Reserved.
FAQ
Terms of Use
Privacy Policy
Copyright
This page was served by apollo6 in 0.156 seconds.