Optimal inventory management for a retail chain with diverse store demands

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.     

A fuzzy linear programming based approach for tactical supply chain planning in an uncertainty environment

This paper models supply chain (SC) uncertainties by fuzzy sets and develops a fuzzy linear programming model for tactical supply chain planning in a multi-echelon, multi-product, multi-level, multi-period supply chain network. In this approach, the demand, process and supply uncertainties are jointly considered. The aim is to centralize multi-node decisions simultaneously to achieve the best use of the available resources along the time horizon so that customer demands are met at a minimum cost. This proposal is tested by using data from a real automobile SC. The fuzzy model provides the decision maker (DM) with alternative decision plans with different degrees of satisfaction.     

A fuzzy newsvendor approach to supply chain coordination

In the absence of a clear command and control structure, a key challenge in supply chain management is the coordination and alignment of supply chain members who pursue divergent and often conflicting goals. The newsvendor model is typically used as a framework to quantify the cost of misalignment and to assess the impact of various coordination initiatives. The application of the newsvendor framework, however, requires the specification of some probability distribution for the sources of uncertainty, and in particular, for the market demand. The specification of an adequate demand distribution becomes difficult in the absence of statistical data. We therefore consider a fuzzy approach to the newsvendor problem. We use several fuzzy parameters in the model for the demand, the wholesale price, and the market sales price. We solve the fuzzy newsvendor problem to study three coordination policies: quantity discounts, profit sharing, and buyback. For each coordination policy, the optimal order quantity of the retailer is computed. The possible profits of the members in the supply chain are calculated with minimum sharing of private information. We further extend the fuzzy newsvendor model to a setting with a single manufacturer and multiple retailers under the assumption of ample capacity for the manufacturer. Detailed numerical examples are also provided.     

Adaptive fuzzy vendor managed inventory control for mitigating the Bullwhip effect in supply chains

This paper proposes an adaptive fuzzy control application to support a vendor managed inventory (VMI). The methodology applies fuzzy control to generate an adaptive smoothing constant in the forecast method, production and delivery plan to eliminate, for example, the rationing and gaming or the Houlihan effect and the order batching effect or the Burbidge effects and finally the Bullwhip effect. The results show that the adaptive fuzzy VMI control surpasses fuzzy VMI control and traditional VMI in terms of mitigating the Bullwhip effect and lower delivery overshoots and backorders. This paper also guides management in allocating inventory by coordinating suppliers and buyers to ensure minimum inventory levels across a supply chain. Adaptive fuzzy VMI control is the main contribution of this paper.     

Revised multi-choice goal programming for multi-period,multi-stage inventory controlled supply chain model with popup stores in Guerrilla marketing

In this paper, we consider a supply chain network design problem with popup stores which can be opened for a few weeks or months before closing seasonally in a marketplace. The proposed model is multi-period and multi-stage with multi-choice goals under inventory management constraints and formulated by 0–1 mixed integer linear programming. The design tasks of the problem involve the choice of the popup stores to be opened and the distribution network design to satisfy the demand with three multi-choice goals. The first goal is minimization of the sum of transportation costs in all stages; the second is to minimization of set up costs of popup stores; and the third goal is minimization of inventory holding and backordering costs. Revised multi-choice goal programming approach is applied to solve this mixed integer linear programming model. Also, we provide a real-world industrial case to demonstrate how the proposed model works.     

Fuzzy goal programming approach to multilevel programming problems

The purpose of this paper is to propose a procedure for solving multilevel programming problems in a large hierarchical decentralized organization through linear fuzzy goal programming approach. Here, the tolerance membership functions for the fuzzily described objectives of all levels as well as the control vectors of the higher level decision makers are defined by determining individual optimal solution of each of the level decision makers. Since the objectives are potentially conflicting in nature, a possible relaxation of the higher level decision is considered for avoiding decision deadlock. Then fuzzy goal programming approach is used for achieving highest degree of each of the membership goals by minimizing negative deviational variables. Sensitivity analysis with variation of tolerance values on decision vectors is performed to present how the solution is sensitive to the change of tolerance values. The efficiency of our concept is ascertained by comparing results with other fuzzy programming approaches.     

A framework for the value of information in inventory replenishment

Technological advances and changes in supply chain management practices have combined to draw attention to the value of information sharing in inventory replenishment. Academic research has produced seemingly conflicting results due to differences in the type of information that is shared, the supply chain structure, and the selection and parameterization of performance goals. This research provides a framework to help explain apparent differences in the extant literature. Our purpose is to understand what determines the value of information. With this specific view, we establish a set of research questions and suggest directions for future research.     

Goodwill,inventory penalty,and adaptive supply chain management

Information visibility is generally useful for decision makers distributed across supply chains. Availability of information on inventory levels, price, lead times, demand, etc. can help reduce uncertainties as well as alleviate problems associated with bullwhip effect. A majority of extant literature in this area assume a static supply chain network configuration. While this was sufficient a few decades ago, advances in e-commerce and the ease with which order processing can be performed over the Internet necessitates appropriate dynamic (re)configuration of supply chains over time. Each node in the supply chain is modeled as an actor who makes independent decisions based on information gathered from the next level upstream. A knowledge-based framework is used for dynamic supply chain configuration and to consider the effects of inventory constraints and ‘goodwill,’ as well as their effects on the performance dynamics of supply chains. Preliminary results indicate that neither static nor dynamic configurations are consistently dominant. Scenarios where static configurations perform better than the modeled system are identified.     

A continuous-review inventory model with random disruptions at the primary supplier

We consider a continuous-review inventory problem for a retailer facing constant customer demand for a single product. This retailer is assumed to follow the well known and widely used order-up-to policy in making replenishment decisions, and can order from two suppliers who differ in reliability and costs. Supplier 1, the primary supplier, is cheaper, but is subject to random disruptions. Supplier 2, the backup supplier or the contingent source, is more expensive, but is perfectly reliable. If Supplier 1 is available when the inventory level at the retailer reaches the reorder point, the retailer orders from Supplier 1. Otherwise, it will wait for a while to see if Supplier 1 can recover from the disruption quickly. If so, it will still get replenishment from Supplier 1 to take advantage of its lower charge. However, the retailer will reroute to the backup supplier if Supplier 1 still does not recover from the disruption when the cap of waiting (the maximal waiting time of the retailer if Supplier 1 is disrupted) is reached. We analytically study the optimal sourcing and replenishment decisions at the retailer, and the impacts of various problem parameters on the optimal decisions. We also conduct extensive numerical experiments to compare different sourcing and replenishment decisions the retailer can make and get further managerial insights into the problem.     

Single-vendor multi-buyer inventory coordination under private information

This paper considers the problem of coordinating a single-vendor multi-buyer inventory system when there are privacy restrictions in the information required to solve the problem. The objective function and cost parameters of each facility are regarded as private information that no other facilities in the system have access to. Moreover, each facility is responsible to specify its own replenishment policy. The objective is to minimize the total average setup/ordering and inventory-related cost. Solution methodologies under private and global information are developed to find two types of nested power-of-two stationary policies. The first policy assumes all the buyers must replenish simultaneously. The second policy is a more general case where the common replenishment assumption is relaxed. A simple form of information exchange is uncovered that allows the solution methodologies for private and global information yield the same results. The experimental results suggest that the performance of the proposed heuristics is comparable or better than an existing method.     

A continuous approximation procedure for determining inventory distribution schemas within supply chains

This paper presents an integrated inventory distribution optimization model that simultaneously incorporates the issues of location, production, inventory, and transportation within a supply chain. The objective is to determine the optimal number and size of shipments under varying but commonly practiced production and shipping scenarios. A continuous approximation procedure is proposed to determine the optimal number and size of shipments. Three production and shipping scenarios are investigated and closed form expressions for the optimal number of shipments for each scenario are obtained. A numerical example is presented to demonstrate the usefulness of the model.     

Central versus local multiple stage inventory planning: An analysis of solutions

Supply chain management refers to the integration of all activities associated with moving goods from raw material stages through to end users. Yet this system-wide vision of inventory planning often requires the coordination of several commercially independent entities, such as suppliers, manufacturers and distributors. This study explores the issue of friction between replenishment policies, defined as the disparity between centrally and locally planned solutions to 98,820 deterministic, multiple stage inventory planning problems modeling systems of varying levels of complexity. Friction is found to be strongly related to certain cost factors, suggesting that certain supply chains could be more vulnerable to tension and inefficiencies when replenishment policies are derived without cooperation between commercially independent yet logistically interdependent stages. These results can also be applied to identify relationships between the findings of otherwise seemingly disparate previous studies of coordination schemes for supply chain partners.     

Optimal inventory policies with two modes of freight transportation

Theoretical inventory models with constant demand rate and two transportation modes are analyzed in this paper. The transportation options are truckloads with fixed costs, a package delivery carrier with a constant cost per unit, or using a combination of both modes simultaneously. Exact algorithms for computing the optimal policies are derived for single stage models over both an infinite and a finite planning horizon.     

Multi-item inventory control with full truckloads: A comparison of aggregate and individual order triggering

In this paper, we consider the stochastic joint replenishment problem in an environment where transportation costs are dominant and full truckloads or full container loads are required. One replenishment policy, taking into account capacity restrictions of the total order volume, is the so-called QS policy, where replenishment orders are placed to raise the individual inventory positions of all items to their order-up-to levels, whenever the aggregate inventory position drops below the reorder level. We first provide a method to compute the policy parameters of a QS policy such that item target service levels can be met, under the assumption that demand can be modeled as a compound renewal process. The approximation formulas are based on renewal theory and are tested in a simulation study which reveals good performance. Second, we compare the QS policy with a simple allocation policy where replenishment orders are triggered by the individual inventory positions of the items. At the moment when an individual inventory position drops below its item reorder level, a replenishment order is triggered and the total vehicle capacity is allocated to all items such that the expected elapsed time before the next replenishment order is maximized. In an extensive simulation study it is illustrated that the QS policy outperforms this allocation policy since it results in lower inventory levels for the same service level. Although both policies lead to similar performance if items are identical, it can differ substantially if the item characteristics vary.     

Analysis of a newsvendor which has errors in inventory data records

Although supply chain scholars very often assume the availability of error free data pertaining to the flow of goods that come in and go out of an inventory system as well as the on hand inventory level, some recent investigations show that this may not be true even in facilities where advanced item identification and data capture technologies such as the barcode system are used. This paper proposes a single period model where the inventory data capture process using the barcode system is prone to errors that lead to inaccuracies. In the first part of our work, we derive analytically the optimal policy in presence of errors when both demand and errors are uniformly distributed. In the second part, we examine quantitatively the impact of record inaccuracies on the performance of an inventory system, in terms of additional overage and shortage costs incurred.     

A production-inventory model with probabilistic deterioration in two-echelon supply chain management

In this study, a production-inventory model is developed for a deteriorating item in a two-echelon supply chain management (SCM). An algebraical approach is applied to find the minimum cost related to this entire SCM. We consider three types of continuous probabilistic deterioration function to find the associated cost. The purpose of this study is to obtain the minimum cost with integer number of deliveries and optimum lotsize for the three different models. Some numerical examples, sensitivity analysis and graphical representation are given to illustrate the model. A numerical comparison between the three models is also given.     

A continuous approximation approach for the integrated facility-inventory allocation problem

In today’s retail business many companies have a complex distribution network with several national and regional distribution centers. This article studies an integrated facility location and inventory allocation problem for designing a distribution network with multiple distribution centers and retailers. The key decisions are where to locate the regional distribution centers (RDCs), how to assign retail stores to RDCs and what should be the inventory policy at the different locations such that the total network cost is minimized. Due to the complexity of the problem, a continuous approximation (CA) model is used to represent the network. Nonlinear programming techniques are developed to solve the optimization problems. The main contribution of this work lies in developing a new CA modeling technique when the discrete data cannot be modeled by a continuous function and applying this technique to solve an integrated facility location-allocation and inventory-management problem. Our methodology is illustrated with the network from a leading US retailer. Numerical analysis suggests that the total cost is significantly lower in the case of the integrated model as compared with the non-integrated model, where the location-allocation and inventory-management problems are considered separately. This paper also studies the effects of changing parameter values on the optimal solutions and to point out some management implications.     

A (Q, R) inventory replenishment model with two delivery modes

Although splitting shipments across multiple delivery modes typically increases total shipping costs as a result of diseconomies of scale, it may offer certain benefits that can more than offset these costs. These benefits include a reduction in the probability of stockout and in the average inventory costs. We consider a single-stage inventory replenishment model that includes two delivery modes: a cheaper, less reliable mode, and another, more expensive but perfectly reliable mode. The high-reliability mode is only utilized in replenishment intervals in which the lead time of the less-reliable mode exceeds a certain value. This permits substituting the high-reliability mode for safety stock, to some degree. We characterize optimal replenishment decisions with these two modes, as well as the potential benefits of simultaneously using two delivery modes.     

Determining near optimal base-stock levels in two-stage general inventory systems

This paper proposes an easily implementable, scalable decomposition heuristic for determining near optimal base stocks in two-level general inventory systems. In this heuristic, the general system is decomposed into assembly systems—one for each end product. For these assembly systems, the base-stock levels are calculated separately, taking into account risk-pooling effects for the common components. Our numerical analyses yield two main insights: First, the base-stock levels determined by the heuristic are close-to-optimal. Second, considerable improvements can be obtained compared to common-sense heuristics.     

Endogenous information acquisition in supply chain management

In this paper, we analyze an endogenous determination of efforts put into information acquisition and its impact on supply chain management. More specifically, we consider a supplier who sells a product to a buyer during a single selling season. Prior to placing an order with the supplier, the buyer has an option to acquire additional information about the demand by hiring experts (who are capable of providing forecasts). Because a commission fee must be paid to each hired expert, there exists a tradeoff between the cost and the value of the information, and the buyer needs to determine how much information to acquire. We derive the optimal information-acquisition level in an integrated setting and compare it with that determined in a decentralized setting. We also analyze several types of supply contracts to examine if they can coordinate the supply chain and allow an arbitrary division of system profit between the supplier and the buyer.