Article ID: | iaor20128031 |
Volume: | 225 |
Issue: | 3 |
Start Page Number: | 393 |
End Page Number: | 403 |
Publication Date: | Mar 2013 |
Journal: | European Journal of Operational Research |
Authors: | Agrawal Narendra, Smith Stephen A |
Keywords: | programming: dynamic, inventory, supply & supply chains |
Item demands at individual retail stores in a chain often differ significantly, due to local economic conditions, cultural and demographic differences and variations in store format. Accounting for these variations appropriately in inventory management can significantly improve retailers’ profits. For example, it is shown that having greater differences across the mean store demands leads to a higher expected profit, for a given inventory and total mean demand. If more than one inventory shipment per season is possible, the analysis becomes dynamic by including updated demand forecasts for each store and re‐optimizing store inventory policies in midseason. In this paper, we formulate a dynamic stochastic optimization model that determines the total order size and the optimal inventory allocation across nonidentical stores in each period. A generalized Bayesian inference model is used for demands that are partially correlated across the stores and time periods. We also derive a normal approximation for the excess inventory from the previous period, which allows the dynamic programming formulation to be easily solved. We analyze the tradeoffs between obtaining information and profitability, e.g., stocking more stores in period 1 provides more demand information for period 2, but does not necessarily lead to higher total profit. Numerical analyses compare the expected profits of alternative supply chain strategies, as well as the sensitivity to different distributions of demand across the stores. This leads to novel strategic insights that arise from adopting inventory policies that vary by store type.