Managing Retail Shelf and Backroom Inventories When Demand Depends on the Shelf‐Stock Level

Inventory displayed on the retail sales floor not only performs the classical supply function but also plays a role in affecting consumers’ buying behavior and hence the total demand. Empirical evidence from the retail industry shows that for some types of products, higher levels of on‐shelf inventory have a demand‐increasing effect (“billboard effect”) while for some other types of products, higher levels of on‐shelf inventory have a demand‐decreasing effect (“scarcity effect”). This suggests that retailers may use the amount of shelf stock on display as a tool to influence demand and operate a store backroom to hold the inventory of items not displayed on the shelves, introducing the need for efficient management of the backroom and on‐shelf inventories. The purpose of this study is to address such an issue by considering a periodic‐review inventory system in which demand in each period is stochastic and depends on the amount of inventory displayed on the shelf. We first analyze the problem in a finite‐horizon setting and show under a general demand model that the system inventory is optimally replenished by a base‐stock policy and the shelf stock is controlled by two critical points representing the target levels to raise up/drop down the on‐shelf inventory level. In the infinite‐horizon setting, we find that the optimal policies simplify to stationary base‐stock type policies. Under the billboard effect, we further show that the optimal policy is monotone in the system states. Numerical experiments illustrate the value of smart backroom management strategy and show that significant profit gains can be obtained by jointly managing the backroom and on‐shelf inventories.     

Note on “The Backroom Effect in Retail Operations”

Eroglu et al. (2013) study a retailer with limited shelf capacity and a backroom. They study a continuous review (r, q) ordering policy with a known order quantity, q. Assuming that backorders can be satisfied from the backroom inventory (if available), they find the expression for the optimal reorder level, r. Our work builds on Eroglu et al. (2013). We correct an erroneous derivation of the expected overflow term, as well as derive an exact expression for the expected cost function, and hence optimal reorder level, instead of the approximate one used by Eroglu et al. (2013).     

Shelf Space Management When Demand Depends on the Inventory Level

Two factors that their influence on the demand has been investigated in many papers are (i) the shelf space allocated to a product and to its complement or supplement products and (ii) the instantaneous inventory level seen by customers. Here we analyze the joint shelf space allocation and inventory decisions for multiple items with demand that depends on both factors. The traditional approach to solve inventory models with a state‐dependent demand rate uses a time domain approach. However, this approach often does not lead to closed‐form expressions for the profit rate with both dependencies. We analyze the problem in the inventory domain via level crossing theory. This approach leads to closed‐form expressions for a large set of demand rate functions exhibiting both dependencies. These closed‐form expressions substantially simplify the search for optimal solutions; thus we use them to solve the joint inventory control and shelf space allocation problem. We consider examples with two products to investigate the significance of capturing both demand dependencies. We show that in some settings it is important to capture both dependencies. We consider two heuristics, each one of them ignores one of the two dependencies. Using these heuristics it seems that ignoring the dependency on the shelf space might be less harmful than ignoring the dependency on the inventory level, which, based on computational results, can lead to profit losses of more than 6%. We demonstrate that retailers should use their operational control, e.g., reorder point, to promote higher demand products.     

Optimal Inventory Control with Retail Pre‐Packs

A pre‐pack is a collection of items used in retail distribution. By grouping multiple units of one or more stock keeping units (SKU), distribution and handling costs can be reduced; however, ordering flexibility at the retail outlet is limited. This paper studies an inventory system at a retail level where both pre‐packs and individual items (at additional handling cost) can be ordered. For a single‐SKU, single‐period problem, we show that the optimal policy is to order into a “band” with as few individual units as possible. For the multi‐period problem with modular demand, the band policy is still optimal, and the steady‐state distribution of the target inventory position possesses a semi‐uniform structure, which greatly facilitates the computation of optimal policies and approximations under general demand. For the multi‐SKU case, the optimal policy has a generalized band structure. Our numerical results show that pre‐pack use is beneficial when facing stable and complementary demands, and substantial handling savings at the distribution center. The cost premium of using simple policies, such as strict base‐stock and batch‐ordering (pre‐packs only), can be substantial for medium parameter ranges.     

Sourcing from Multiple Suppliers for Price‐Dependent Demands

We analyze a model that integrates demand shaping via dynamic pricing and risk mitigation via supply diversification. The firm under consideration replenishes a certain product from a set of capacitated suppliers for a price‐dependent demand in each period. Under deterministic capacities, we derive a multilevel base stock list price policy and establish the optimality of cost‐based supplier selection, that is, ordering from a cheaper source before more expensive ones. With general random capacities, however, neither result holds. While it is optimal to price low for a high inventory level, the optimal order quantities are not monotone with respect to the inventory level. In general, a near reorder‐point policy should be followed. Specifically, there is a reorder point for each supplier such that no order is issued to him when the inventory level is above this point and a positive order is placed almost everywhere when the inventory level is below this point. Under this policy, it may be profitable to order exclusively from the most expensive source. We characterize conditions under which a strict reorder‐point policy and a cost‐based supplier‐selection criterion become optimal. Moreover, we quantify the benefit from dynamic pricing, as opposed to static pricing, and the benefit from multiple sourcing, as opposed to single sourcing. We show that these two strategies exhibit a substitutable relationship. Dynamic pricing is less effective under multiple sourcing than under single sourcing, and supplier diversification is less valuable with price adjustments than without. Under limited supply, dynamic pricing yields a robust, long‐term profit improvement. The value of supply diversification, in contrast, mainly comes from added capacities and is most significant in the short run.     

Inventory Rationing for Multiple Class Demand under Continuous Review

We consider how a firm should ration inventory to multiple classes in a stochastic demand environment with partial, class‐dependent backlogging where the firm incurs a fixed setup cost when ordering from its supplier. We present an infinite‐horizon, average cost criterion Markov decision problem formulation for the case with zero lead times. We provide an algorithm that determines the optimal rationing policy, and show how to find the optimal base‐stock reorder policy. Numerical studies indicate that the optimal policy is similar to that given by the equivalent deterministic problem and relies on tracking both the current inventory and the rate that backorder costs are accumulating. Our study of the case of non‐zero lead time shows that a heuristic combining the optimal, zero lead time policy with an allocation policy based on a single‐period profit management problem is effective.     

Myopic Analysis for Multi‐Echelon Inventory Systems with Batch Ordering and Nonstationary/Time‐Correlated Demands

We provide an exact myopic analysis for an N‐stage serial inventory system with batch ordering, linear ordering costs, and nonstationary demands under a finite planning horizon. We characterize the optimality conditions of the myopic nested batching newsvendor (NBN) policy and the myopic independent batching newsvendor (IBN) policy, which is a single‐stage approximation. We show that echelon reorder levels under the NBN policy are upper bounds of the counterparts under both the optimal policy and the IBN policy. In particular, we find that the IBN policy has bounded deviations from the optimal policy. We further extend our results to systems with martingale model of forecast evolution (MMFE) and advance demand information. Moreover, we provide a recursive computing procedure and optimality conditions for both heuristics which dramatically reduces computational complexity. We also find that the NBN problem under the MMFE faced by one stage has one more dimension for the forecast demand than the one faced by its downstream stage and that the NBN policy is optimal for systems with advance demand information and stationary problem data. Numerical studies demonstrate that the IBN policy outperforms on average the NBN policy over all tested instances when their optimality conditions are violated.     

Dynamic Pricing and Inventory Management with Dual Suppliers of Different Lead Times and Disruption Risks

It is common for a firm to make use of multiple suppliers of different delivery lead times, reliabilities, and costs. In this study, we are concerned with the joint pricing and inventory control problem for such a firm that has a quick‐response supplier and a regular supplier that both suffer random disruptions, and faces price‐sensitive random demands. We aim at characterizing the optimal ordering and pricing policies in each period over a planning horizon, and analyzing the impacts of supply source diversification. We show that, when both suppliers are unreliable, the optimal inventory policy in each period is a reorder point policy and the optimal price is decreasing in the starting inventory level in that period. In addition, we show that having supply source diversification or higher supplier reliability increases the firm's optimal profit and lowers the optimal selling price. We also demonstrate that, with the selling price as a decision, a supplier may receive even more orders from the firm after an additional supplier is introduced. For the special case where the quick‐response supplier is perfectly reliable, we further show that the optimal inventory policy is of a base‐stock type and the optimal pricing policy is a list‐price policy with markdowns.     

区分仓库与货架库存需求影响效应的零售商库存决策

既往有关库存水平影响需求条件下的库存问题研究中,通常对终端库存水平是否存在货架与零售商仓库库存水平的区别未作深入探讨。本文的研究认为,现实中许多零售商拥有仓库,其现有库存水平包括仓库库存和货架库存两部分,而影响需求的仅为与货架展示能力相关的库存,因此有必要对二者的需求影响效应进行区分。在明确这一区别的前提下,本文首先建立了供应商管理库存情况下库存水平影响需求问题的一般库存模型,给出零售商的最优订货策略;并考虑货架的容量限制,给出零售商启用仓库的判断条件。由于仓库库存仅在能够影响货架展示能力的条件下才能够影响消费需求,本文还进一步讨论了在零售商拥有仓库时,区分货架与仓库的库存水平影响需求条件下的最优库存与订货决策。这对于经营不同特征商品的零售商在进行是否需要拥有仓库,以及拥有仓库条件下的库存决策具有很好的参考价值。     

基于货架空间成本共担的不同权力供应链均衡分析

针对产品需求受货架空间与零售价格共同影响的两级供应链,通过比较供应商主导、零售商主导和权力均等三种不同权力结构供应链均衡结果,分析了供应商与零售商共同承担货架空间成本对供应链定价、货架空间分配和利润的影响。研究结果表明:供应商与零售商共同承担货架空间成本会减少供应商主导供应链的整体利润,但会使零售商主导和权力均等供应链通过分配更多的货架空间增加产品销量,在一定范围内使得供应链整体利润得到提高。由于三种不同权力结构供应链均未达到整体最优,提出了基于货架成本共担的收入共享合同,并给出了供应商和零售商均能接受的分配方案。     

Dual Sourcing Under Random Supply Capacities: The Role of the Slow Supplier

Sourcing from multiple suppliers with different characteristics is common in practice for various reasons. This paper studies a dynamic procurement planning problem in which the firm can replenish inventory from a fast and a slow supplier, both with uncertain capacities. The optimal policy is characterized by two reorder points, one for each supplier. Whenever the pre‐order inventory level is below the reorder point, a replenishment order is issued to the corresponding supplier. Interestingly, the reorder point for the slow supplier can be higher than that of the fast even if the former has a higher cost, lower reliability, and smaller capacity than the latter, suggesting the possibility of ordering exclusively from an inferior slow supplier in the short term. Moreover, the firm may allocate a larger portion of the long‐term total order quantity to the slow supplier than to the fast, even if the former does not possess any cost or reliability advantage over the latter. Such phenomena, different from the observations made in previous studies, happen when the demand is uncertain and the supply is limited or unreliable. Our observations highlight the importance of incorporating both demand uncertainty and supplier characteristics (i.e., cost, lead time, capacity and uncertainty) in a unified framework when formulating supplier selection and order allocation strategies.     

Inventory Rationing in a Make‐to‐Stock System with Batch Production and Lost Sales

We address an inventory rationing problem in a lost sales make‐to‐stock (MTS) production system with batch ordering and multiple demand classes. Each production order contains a single batch of a fixed lot size and the processing time of each batch is random. Assuming that there is at most one order outstanding at any point in time, we first address the case with the general production time distribution. We show that the optimal order policy is characterized by a reorder point and the optimal rationing policy is characterized by time‐dependent rationing levels. We then approximate the production time distribution with a phase‐type distribution and show that the optimal policy can be characterized by a reorder point and state‐dependent rationing levels. Using the Erlang production time distribution, we generalize the model to a tandem MTS system in which there may be multiple outstanding orders. We introduce a state‐transformation approach to perform the structural analysis and show that both the reorder point and rationing levels are state dependent. We show the monotonicity of the optimal reorder point and rationing levels for the outstanding orders, and generate new theoretical and managerial insights from the research findings.     

The Retail Space‐Exchange Problem with Pricing and Space Allocation Decisions

We consider retail space‐exchange problems where two retailers exchange shelf space to increase accessibility to more of their consumers in more locations without opening new stores. Using the Hotelling model, we find two retailers’ optimal prices, given their host and guest space in two stores under the space‐exchange strategy. Next, using the optimal space‐dependent prices, we analyze a non‐cooperative game, where each retailer makes a space allocation decision for the retailer's own store. We show that the two retailers will implement such a strategy in the game, if and only if their stores are large enough to serve more than one‐half of their consumers. Nash equilibrium for the game exists, and its value depends on consumers’ utilities and trip costs as well as the total available space in each retailer's store. Moreover, as a result of the space‐exchange strategy, each retailer's prices in two stores are both higher than the retailer's price before the space exchange, but they may or may not be identical.     

VMI环境下库存竞争性产品的补货策略及最优货架空间的确定

本文在文献[1]的研究基础上,通过深入剖析FKO模型,运用动态规划方法,探讨了呈现特殊需求性质的库存竞争性产品在VMI环境下的多期动态补货策略,以及传统库存管理中不加考虑的库存空间优化问题。本文一方面是对FKO模型的补充与扩展,同时也证实了对于在特定的VMI补货环境下采用多期库存盘查模式的供应商来说,封顶式的补货策略是最优的,并且其关于最优补货水平的多期决策都是无远见的。因此收益分享合同下的单期最优库存水平可以作为设定最优货架展示空间的依据。     

A mixed inventory model with variable lead time and random supplier capacity

In this paper, we have studied analytically the implication of a controllable lead-time and a random supplier capacity on the continuous review inventory policy, in which the order quantity, reorder point and lead-time are decision variables. Two models are considered: the normal lead-time demand and lead-time demand is distributed free. For both cases, after formulating the general model, some properties of the optimal ordering policy have been developed. Particularly, we have shown that the expected annual total cost is a unimodal function and quasi-convex in the order quantity. When the variable capacity distribution is exponential, we develop effective procedures for finding the optimal solutions. Furthermore, the effects of parameters are also performed.     

Replenishment Policies for Multi‐Product Stochastic Inventory Systems with Correlated Demand and Joint‐Replenishment Costs

This study analyzes optimal replenishment policies that minimize expected discounted cost of multi‐product stochastic inventory systems. The distinguishing feature of the multi‐product inventory system that we analyze is the existence of correlated demand and joint‐replenishment costs across multiple products. Our objective is to understand the structure of the optimal policy and use this structure to construct a heuristic method that can solve problems set in real‐world sizes/dimensions. Using an MDP formulation we first compute the optimal policy. The optimal policy can only be computed for problems with a small number of product types due to the curse of dimensionality. Hence, using the insight gained from the optimal policy, we propose a class of policies that captures the impact of demand correlation on the structure of the optimal policy. We call this class (s, c, d, S)‐policies, and also develop an algorithm to compute good policies in this class, for large multi‐product problems. Finally using an exhaustive set of computational examples we show that policies in this class very closely approximate the optimal policy and can outperform policies analyzed in prior literature which assume independent demand. We have also included examples that illustrate performance under the average cost objective.     

The Retail Planning Problem Under Demand Uncertainty

We consider the retail planning problem in which the retailer chooses suppliers and determines the production, distribution, and inventory planning for products with uncertain demand to minimize total expected costs. This problem is often faced by large retail chains that carry private‐label products. We formulate this problem as a convex‐mixed integer program and show that it is strongly NP‐hard. We determine a lower bound by applying a Lagrangian relaxation and show that this bound outperforms the standard convex programming relaxation while being computationally efficient. We also establish a worst‐case error bound for the Lagrangian relaxation. We then develop heuristics to generate feasible solutions. Our computational results indicate that our convex programming heuristic yields feasible solutions that are close to optimal with an average suboptimality gap at 3.4%. We also develop managerial insights for practitioners who choose suppliers and make production, distribution, and inventory decisions in the supply chain.     

OPTIMALITY OF STATE-DEPENDENT (s,S) POLICIES IN INVENTORY MODELS WITH MARKOV-MODULATED DEMAND AND LOST SALES

Markov-modulated processes have been used in stochastic inventory models with setup costs for modeling demand under the influence of uncertain environmental factors, such as fluctuating economic and market conditions. The analyses of these models have been carried out in the literature only under the assumption that unsatisfied demand is fully backlogged. The lost sales situation occurs in many retail establishments such as department stores and supermarkets. We use the analysis of the Markovian demand model with backlogging to analyze the lost sales case; in particular, we establish the optimality of an (s, S)-type policy under fairly general conditions.     

A Comparison of Three Joint Ordering Inventory Policies*

This paper evaluates the performance of a joint ordering inventory policy which was first suggested and characterized by Renberg and Planche [14]. This paper shows that the policy is easily characterized for Poisson demands. This policy is then compared with two other joint ordering policies—the well-known (S, c, s) or can-order policy of Balintfy [3] and the recent periodic policies suggested by Atkins and lyogun [2]. For a continuous review operating environment, the Renberg and Planche policy utilizes a group reorder point and a combined order quantity (Q), with each item maintaining an order-up-to level (S). For the can-order policy, each item in the product group has a must-order point (s), a can-order point (c) and an order-up-to level (S). The periodic policies require that item orders be grouped at some fixed scheduled intervals. Using long-run total average costs as the basis, it is shown that no one policy is superior to the others in all the examples tested. In some cases, the Renberg and Planche policy performs surprisingly well.     

Multi-Item Grouping Algorithm Yielding Near-Optimal Logistics Cost

This article describes an algorithm used to formulate an inbound consolidation strategy when multi-items are replenished in groups and when total logistics cost is to be minimized. The importance of this algorithm is threefold (1) no optimal procedure exists for grouping multi-items when minimizing total logistics cost, (2) a complete enumeration of all possible groups (from which the optimal grouping set can be identified) is impractical due to the combinatorial nature of the grouping problem, and (3) no other heuristics have been developed that adequately reflect shipping cost in the analysis like this one does. We report the experience of using this algorithm to group and reorder 75 selected ensembles containing a total of 517 inventory items of a retail merchandising firm.