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.     

Managing Inventory with Cash Register Information: Sales Recorded but Not Demands

Inventory inaccuracy is common in many businesses. While retailers employ cash registers to enter incoming orders and outgoing sales, inaccuracy arises because they do not record invisible demand such as spoilage, damage, pilferage, or returns. This setting results in incomplete inventory and demand information. An important inventory control problem therefore is to maximize the total expected discounted profit under this setting. Allowing for dependence between demand and invisible demand, we obtain the associated dynamic programming equation with an infinite‐dimensional state space, and reduce it to a simpler form by employing the concept of unnormalized probability. We develop an analytical upper bound on the optimal profit as well as an iterative algorithm for an approximate solution of the problem. We compare profits of the iterative solution and the myopic solution, and then to the upper bound. We see that the iterative solution performs better than the myopic solution, and significantly so in many cases. Furthermore, it gives a profit not far from the upper bound, and is therefore close to optimal. Using our results, we also discuss meeting inventory service levels.     

Heuristics for Base‐Stock Levels in Multi‐Echelon Distribution Networks

We study inventory optimization for locally controlled, continuous‐review distribution systems with stochastic customer demands. Each node follows a base‐stock policy and a first‐come, first‐served allocation policy. We develop two heuristics, the recursive optimization (RO) heuristic and the decomposition‐aggregation (DA) heuristic, to approximate the optimal base‐stock levels of all the locations in the system. The RO heuristic applies a bottom‐up approach that sequentially solves single‐variable, convex problems for each location. The DA heuristic decomposes the distribution system into multiple serial systems, solves for the base‐stock levels of these systems using the newsvendor heuristic of Shang and Song (2003), and then aggregates the serial systems back into the distribution system using a procedure we call “backorder matching.” A key advantage of the DA heuristic is that it does not require any evaluation of the cost function (a computationally costly operation that requires numerical convolution). We show that, for both RO and DA, changing some of the parameters, such as leadtime, unit backordering cost, and demand rate, of a location has an impact only on its own local base‐stock level and its upstream locations’ local base‐stock levels. An extensive numerical study shows that both heuristics perform well, with the RO heuristic providing more accurate results and the DA heuristic consuming less computation time. We show that both RO and DA are asymptotically optimal along multiple dimensions for two‐echelon distribution systems. Finally, we show that, with minor changes, both RO and DA are applicable to the balanced allocation policy.     

Competing for Shelf Space

In recent years, the competition for shelf space has intensified, as more products now compete for a retail space that has remained roughly constant. In this paper, we analyze the dynamics of this competition in a multi‐supplier retail point. Assuming that sales are shelf space dependent, we consider a retailer that optimizes its shelf space allocation among different products based on their sales level and profit margins. In this context, product manufacturers set their wholesale prices so as to obtain larger shelf space allocations but at the same time keep margins as high as possible. We analyze the equilibrium situation in the supply chain, and find that generally the retailer's and the suppliers' incentives are misaligned, resulting in suboptimal retail prices and shelf space allocations. We however find that the inefficiencies induced by suboptimal shelf space allocation decisions are small relative to those induced by suboptimal pricing decisions.     

On the Benefit of Inventory‐Based Dynamic Pricing Strategies

We study the optimal pricing and replenishment decisions in an inventory system with a price‐sensitive demand, focusing on the benefit of the inventory‐based dynamic pricing strategy. We find that demand variability impacts the benefit of dynamic pricing not only through the magnitude of the variability but also through its functional form (e.g., whether it is additive, multiplicative, or others). We provide an approach to quantify the profit improvement of dynamic pricing over static pricing without having to solve the dynamic pricing problem. We also demonstrate that dynamic pricing is most effective when it is jointly optimized with inventory replenishment decisions, and that its advantage can be mostly realized by using one or two price changes over a replenishment cycle.     

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.     

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

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

Grocery Perishables Management

In this article, we study the joint pricing and inventory control problem for perishables when a retailer does not sell new and old inventory at the same time. At the beginning of a period, the retailer makes replenishment and pricing decisions, and at the end of a period, the retailer decides whether to dispose of ending inventory or carry it forward to the next period. The objective of the retailer is to maximize the long‐run average profit. Assuming zero lead time, we propose an efficient solution approach to the problem, which is also generalized to solve three extensions to the basic model. A feature of the present study is that we consider explicitly the influence of perishability on the demand. Among the insights gathered from the numerical analysis, we find that dynamic pricing aids extending shelf life and when disposal incurs a lower cost, or even a positive salvage value, the retailer is induced to dispose earlier since the benefit of selling new inventory offsets the loss due to disposal. We also observe that the faster the perceived rate of deterioration, the lower the threshold of the ending inventory for disposal. Perhaps a bit counter‐intuitive, maximizing profits does not mean eliminating disposals or expirations.     

零售货架的线性补贴策略与供应链协调

考虑由一个供应商和一个零售商构成的供应链,供应商提供零售商单一产品,零售阶段的市场需求量随机地依赖于零售商的货架展示量。由于货架空间的稀缺,零售商的成本为非线性的成本函数以符合实际的情况。如果零售商在观察到需求之前决定货架空间,货架补贴可以提高渠道效率;如果零售商在观察需求之后,进行货架决策,补贴降低了供应链效率。由于零售商的努力水平可以验证,供应商可以使用回购加零售货架的线性补贴策略协调供应链,但是需要考虑零售阶段的库存决策与货架分配的决策顺序,而采取完全不同的协调方式。最后通过数值算例说明了所得结论。     

Late season low inventory assortment effects in the newsvendor problem

The assumption of the newsvendor being able to satisfy demand as long as on-hand inventory is positive does not hold for a non-homogenous product. Consumers who do not find a unit of the product which satisfies their secondary features preferences may not purchase the product even though the newsvendor has positive on-hand inventory. This is likely to occur late in the season as inventory level declines. We solve a newsvendor problem in which the probability of purchase by consumers is increasing in on-hand inventory for any inventory level below that which is needed to have a complete assortment. We identify the sufficient optimality condition for the order quantity. We show that, unlike the case of inventory-dependent demand models in the literature, the optimal order quantity may decrease due to the assortment effect. We investigate two types of pre-end of season discounts, immediate all-units and delayed, as ways to mitigate the late season assortment effect and show that in some cases, they can increase the newsvendor׳s profit and free up the shelf space for other products.     

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

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

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.     

Updating Inventories of Substitutable Resources in Response to Forecast Updates

We show simple yet optimal results to update the inventory/capacity levels, expected profit, fill rates, and service levels of substitutable resources in response to an updating of the mean demand forecasts for the resources. We find that a change in the mean demand of one resource does not affect the optimal inventory level of any other resource. The results are obtained for demands with location‐scale distribution, and for a revenue structure satisfying a triangle property such that the manager will always use the inventory of a resource to meet her own demand first before using it for substitution. The results for updating the performance measures also extend to managers who maintain non‐optimal inventory/capacity levels. Implications for procurement, sales and operational planning, and multi‐store operations are discussed.     

Addressing Supply–Demand Imbalance: Designing Efficient Remanufacturing Strategies

The management of remanufacturing inventory system is often challenged by mismatched supply (i.e., returned units, called cores) and demand. Typically, the demand for remanufactured units is high and exceeds the supply early in a product's lifetime, and drops below the supply late in the lifetime. This supply–demand imbalance motivates us to study a switching strategy to facilitate the decision‐making process. This strategy deploys a push mode at the early stage of a product's lifetime, which remanufactures scarce cores to stock to responsively satisfy the high demand, and switches to a pull mode as the product approaches obsolescence to accurately match the low demand with supply. In addition, the strategy further simplifies the decision‐making process by ignoring the impact of leftover cores at the end of each decision period. We show that the optimal policy of the switching strategy possesses a simple, multi‐dimensional base‐stock structure, which aims to remanufacture units from the i best‐quality categories up to the ith state‐independent base‐stock level. An extensive numerical study shows that the switching strategy delivers close‐to‐optimal and robust performance: the strategy only incurs an average profit loss of 1.21% and a maximum of 2.27%, compared with the optimal one. The numerical study also shows when a pure push or pull strategy, a special case of the switching strategy, delivers good performance. The study offers the managerial insight that firms can use simple, easy‐to‐implement strategies to efficiently manage the remanufacturing inventory system.     

A Model for Determining Retail Product Category Assortment and Shelf Space Allocation

We develop a category management model to aid retailers in the space constrained decisions of which products to stock (assortment) and how much shelf space to allocate to those products. The model is formulated as a constrained optimization problem with two basic decision variables: assortment and allocation of space to the items in the assortment. The non-linearities in the objective function and the zero-one decision variables disallow a closed form solution. We develop a heuristic solution procedure based on simulated annealing and test it on a problem with a known optimum. We also apply the technique to a larger problem without a known optimum. Finally, the solution found by simulated annealing is compared against a solution produced using a shelf allocation rule based on share of sales.     

Managing Slow‐Moving Perishables in the Grocery Industry

We address the value of information and value of centralized control in the context of a two‐echelon, serial supply chain with one retailer and one supplier that provide a single perishable product to consumers. Our analysis is relevant for managing slow‐moving perishable products with fixed lot sizes and expiration dates of a week or less. We evaluate two supply chain structures. In the first structure, referred to as decentralized information sharing, the retailer shares its demand, inventory, and ordering policy with the supplier, yet both facilities make their own profit‐maximizing replenishment decisions. In the second structure, centralized control, incentives are aligned and the replenishment decisions are coordinated. The latter supply chain structure corresponds to the industry practices of company‐owned stores or vendor‐managed inventory. We measure the value of information and value of centralized control as the marginal improvement in expected profits that a supply chain achieves relative to the case when no information is shared and decision making is decentralized. Key assumptions of our model include stochastic demand, lost sales, and fixed order quantities. We establish the importance of information sharing and centralized control in the supply chain and identify conditions under which benefits are realized. As opposed to previous work on the value of information, the major benefit in our setting is driven by the supplier's ability to provide the retailer with fresher product. By isolating the benefit by firm, we show that sharing information is not always Pareto‐improving for both supply chain partners in the decentralized setting.     

Assortment optimisation problem: A distribution-free approach

Assortment optimisation is a critical decision that is regularly made by retailers. The decision involves a trade-off between offering a larger assortment of products but smaller inventories of each product and offering a smaller number of varieties with more inventory of each product. We propose a robust, distribution-free formulation of the assortment optimisation problem such that the assortment and inventory levels can be jointly optimised without making specific assumptions on the demand distributions of each product. We take a max-min approach to the problem that provides a guaranteed lower bound to the expected profit when only the mean and variance of the demand distribution are known. We propose and test three heuristic algorithms that provide solutions in O(nlog (n)) time and identify two cases where one of the heuristics is guaranteed to return optimal policies. Through numerical studies, we demonstrate that one of the heuristics performs extremely well, with an average optimality gap of 0.07% when simulated under varying conditions. We perform a sensitivity analysis of product and store demand attributes on the performance of the heuristic. Finally, we extend the problem by including maximum cardinality constraints on the assortment size and perform numerical studies to test the performance of the heuristics.     

Supply Performance in Multi‐Echelon Inventory Systems with Intermediate Product Demand: A Perspective on Allocation

In this article, we study the performance of multi‐echelon inventory systems with intermediate, external product demand in one or more upper echelons. This type of problem is of general interest in inventory theory and of particular importance in supply chain systems with both end‐product demand and spare parts (subassemblies) demand. The multi‐echelon inventory system considered here is a combination of assembly and serial stages with direct demand from more than one node. The aspect of multiple sources of demands leads to interesting inventory allocation problems. The demand and capacity at each node are considered stochastic in nature. A fixed supply and manufacturing lead time is used between the stages. We develop mathematical models for these multi‐echelon systems, which describe the inventory dynamics and allow simulation of the system. A simulation‐based inventory optimization approach is developed to search for the best base‐stock levels for these systems. The gradient estimation technique of perturbation analysis is used to derive sample‐path estimators. We consider four allocation schemes: lexicographic with priority to intermediate demand, lexiographic with priority to downstream demand, predetermined proportional allocation, and proportional allocation. Based on the numerical results we find that no single allocation policy is appropriate under all conditions. Depending on the combinations of variability and utilization we identify conditions under which use of certain allocation polices across the supply chain result in lower costs. Further, we determine how selection of an inappropriate allocation policy in the presence of scarce on‐hand inventory could result in downstream nodes facing acute shortages. Consequently we provide insight on why good allocation policies work well under differing sets of operating conditions.     

Category Captainship vs. Retailer Category Management under Limited Retail Shelf Space

Shelf‐space scarcity is a predominant aspect of the consumer goods industry. This paper analyzes its implications for category management. We consider a model where two competing manufacturers sell their differentiated products through a single retailer who determines the shelf space allocated to the category. The scope of category management is pricing. We consider two category management mechanisms: retailer category management (RCM), where the retailer determines product prices and category captainship (CC), where a manufacturer in the category determines them. Our analysis reveals that the retailer can use the form of category management and the category shelf space to control the intensity of competition between manufacturers to his benefit. We also show that the emergence of CC depends on the degree of product differentiation, the opportunity cost of shelf space, and the profit sharing arrangement in the alliance. The equilibrium category shelf space under CC may be higher than under RCM if the value to the retailer of eliminating double marginalization and putting price pressure on the non‐captain manufacturer dominates the loss from sharing the profit with the category captain. CC has been criticized for disadvantaging non‐captain manufacturers. While we provide some support for this claim, we also find that CC may benefit non‐captain manufacturers when implemented by a powerful retailer in categories with sufficiently differentiated products, because the shelf space allocated to the category increases in this case.     

Duality Approaches to Economic Lot‐Sizing Games

Sharing common production, resources, and services to reduce cost are important for not for profit operations due to limited and mission‐oriented budget and effective cost allocation mechanisms are essential for encouraging effective collaborations. In this study, we illustrate how rigorous methodologies can be developed to derive effective cost allocations to facilitate sustainable collaborations in not for profit operations by modeling the cost allocation problem arising from an economic lot‐sizing (ELS) setting as a cooperative game. Specifically, we consider the economic lot‐sizing (ELS) game with general concave ordering cost. In this cooperative game, multiple retailers form a coalition by placing joint orders to a single supplier in order to reduce ordering cost. When both the inventory holding cost and backlogging cost are linear functions, it can be shown that the core of this game is non‐empty. The main contribution of this study is to show that a core allocation can be computed in polynomial time under the assumption that all retailers have the same cost parameters. Our approach is based on linear programming (LP) duality. More specifically, we study an integer programming formulation for the ELS problem and show that its LP relaxation admits zero integrality gap, which makes it possible to analyze the ELS game by using LP duality. We show that there exists an optimal dual solution that defines an allocation in the core. An interesting feature of our approach is that it is not necessarily true that every optimal dual solution defines a core allocation. This is in contrast to the duality approach for other known cooperative games in the literature.