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.     

MRP Planned Orders in a Multiple‐Supplier Environment with Differing Lead Times

This study examines a deterministic material requirements planning (MRP) problem where lead times at subsequent ordering moments differ. Adequate replenishment methods that can cope with lead time differences are lacking because of the order crossover phenomenon, that is, replenishment orders are not received in the sequence they are ordered. This study specifies how to handle order crossovers and recalculate planned order releases after an update of gross requirements. The optimal (s, S) policy is based on dynamic programing. The state space is kept to a minimum due to three fundamental insights. The performance of the optimal solution approach is compared with two heuristics based on relaxations and a benchmark approach in which order crossovers are ignored. A numerical analysis reveals that average cost savings up to 25% are possible if the optimal policy is used instead of the benchmark approach. The contribution of this study is threefold: (1) it generalizes theory on MRP ordering, allowing for lead time differences and order crossovers; (2) it develops new fundamental insights and an optimal solution procedure, leading to substantial cost saving; and (3) it provides good‐performing heuristics for a general and realistic replenishment problem that can replace the current replenishment methods within MRP.     

TIME‐BASED PRICING AND LEADTIME POLICIES FOR A BUILD‐TO‐ORDER MANUFACTURER

We studied time‐based policies on pricing and leadtime for a build‐to‐order and direct sales manufacturer. It is assumed that the utility of the product varies among potential customers and decreases over time, and that a potential customer will place an order if his or her utility is higher than the manufacturer's posted price. Once an order is placed, it will be delivered to the customer after a length of time called “leadtime.” Because of the decrease in a customer's utility during leadtime, a customer will cancel the order if the utility falls below the ordering price before the order is received. The manufacturer may choose to offer discounted prices to customers who would otherwise cancel their orders. We discuss two price policies: common discounted price and customized discounted price. In the common discounted price policy, the manufacturer offers a single lower price to the customers; in the customized discounted price policy, the manufacturer offers the customers separately for individual new prices. Our analytical and numerical studies show that the discounted price policies results in higher revenue and that the customized discounted price policy significantly outperforms the common discounted price policy when product utility decreases rapidly. We also study two leadtime policies when production cost decreases over time. The first uses a fixed leadtime, and the second allows the leadtime to vary dynamically over time. We find that the dynamic leadtime policy significantly outperforms the fixed leadtime policy when the product cost decreases rapidly.     

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.     

Managing Electricity Peak Loads in Make‐To‐Stock Manufacturing Lines

In this article, we study the control of stochastic make‐to‐stock manufacturing lines in the presence of electricity costs. Electricity costs are difficult to manage because unit costs increase with the total load, that is, the amount of electricity needed by the manufacturing line at a certain point in time. We demonstrate that standard methods for controlling manufacturing lines cannot be used and that standard analytic results for stochastic manufacturing lines do not hold in the presence of electricity costs. We develop a control policy that balances electricity costs with inventory holding and backorder costs. We derive closed‐form expressions and analytic properties of the expected total cost for manufacturing lines with two workstations and demonstrate the accuracy and robustness of the policy for manufacturing lines with more than two workstations. The results indicate that avoiding electricity peak loads requires additional investment in manufacturing capacity and higher inventory and backorder costs. Our approach also applies to companies which aim at reducing their carbon emissions in addition to their operating costs.     

Mitigating Inventory Overstocking: Optimal Order‐up‐to Level to Achieve a Target Fill Rate over a Finite Horizon

Service level agreements (SLAs) are widely adopted performance‐based contracts in operations management practice, and fill rate is the most common performance metric among all the measurements in SLAs. Traditional procedures characterizing the order‐up‐to level satisfying a specified fill rate implicitly assume an infinite performance review horizon. However, in practice, inventory managers are liable to maintain and report fill rates over a finite performance review horizon. This horizon discrepancy leads to deviation between the target fill rate and actual achieved fill rate. In this study, we first examine the behavior of the fill rate distribution over a finite horizon with positive lead time. We analytically prove that the expected fill rate assuming an infinite performance review horizon exceeds the expected fill rate assuming a finite performance review horizon, implying that there exists some inventory “waste” (i.e., overstocking) when the traditional procedure is used. Based on this observation and the complexity of the problem, we propose a simulation‐based algorithm to reduce excess inventory while maintaining the contractual target fill rate. When the lead time is significant relative to the length of the contract horizon, we show that the improvement in the inventory system can be over 5%. Further, we extend our basic setting to incorporate the penalty for failing to meet a target, and show how one can solve large‐scale problems via stochastic approximation. The primary managerial implication of our study is that ignoring the performance review horizon in an SLA will cause overstocking, especially when the lead time is large.     

Optimal Ordering Policies for Inventory Problems With Dynamic Information Delays

Information delays exist when the most recent inventory information available to the Inventory Manager (IM) is dated. In other words, the IM observes only the inventory level that belongs to an earlier period. Such situations are not uncommon, and they arise when it takes a while to process the demand data and pass the results to the IM. We introduce dynamic information delays as a Markov process into the standard multiperiod stochastic inventory problem with backorders. We develop the concept of a reference inventory position. We show that this position along with the magnitude of the latest observed delay and the age of this observation are sufficient statistics for finding the optimal order quantities. Furthermore, we establish that the optimal ordering policy is of state‐dependent base‐stock type with respect to the reference inventory position (or state‐dependent (s, S) type if there is a fixed ordering cost). The optimal base stock and (s, S) levels depend on the magnitude of the latest observed delay and the age of this observation. Finally, we study the sensitivity of the optimal base stock and the optimal cost with respect to the sufficient statistics.     

Lowest Cost May Not Lower Total Cost: Using “Spackling” to Smooth Mass‐Customized Production

Consider a manufacturer who mass customizes variants of a product in make‐to‐order fashion, and also produces standard variants as make‐to‐stock. A traditional manufacturing strategy would be to employ two separate manufacturing facilities: a flexible plant for mass‐customized items and an efficient plant for standard items. We contrast this traditional focus strategy with an alternative that better utilizes capacity by combining production of mass‐customized and standard items in one of two alternate spackling strategies: (1) a pure‐spackling strategy, where the manufacturer produces everything in a (single) flexible plant, first manufacturing custom products as demanded each period, and then filling in the production schedule with make‐to‐stock output of standard products; or (2) a layered‐spackling strategy, which uses an efficient plant to make a portion of its standard items and a separate flexible plant where it spackles. We identify the optimal production strategy considering the tradeoff between the cost premium for flexible (versus efficient) production capacity and the opportunity costs of idle capacity. Spackling amortizes fixed costs of capacity more effectively and thus can increase profits from mass customization vis‐à‐vis a focus strategy, even with higher cost production for the standard goods. We illustrate our framework with data from a messenger bag manufacturer.     

Optimal Inventory Control with Dual‐Sourcing,Heterogeneous Ordering Costs and Order Size Constraints

We consider a dual‐sourcing inventory system, where procuring from one supplier involves a high variable cost but negligible fixed cost whereas procuring from the other supplier involves a low variable cost but high fixed cost, as well as an order size constraint. We show that the problem can be reduced to an equivalent single‐sourcing problem. However, the corresponding ordering cost is neither concave nor convex. Using the notion of quasi‐convexity, we partially characterize the structure of the optimal policy and show that it can be specified by multiple thresholds which determine when to order from each supplier and how much. In contrast to previous research, which does not consider order size constraints, we show that it is optimal to simultaneously source from both suppliers when the beginning inventory level is sufficiently low. We also show that the decision to source from the low‐cost supplier is not monotonic in the inventory level. Our results require that the variable costs satisfy a certain condition which guarantees quasi‐convexity. However, extensive numerical results suggest that our policy is almost always optimal when the condition is not satisfied. We also show how the results can be extended to systems with multiple capacitated suppliers.     

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.     

Coordinating Supply Chains via Advance‐Order Discounts,Minimum Order Quantities,and Delegations

To avoid inventory risks, manufacturers often place rush orders with suppliers only after they receive firm orders from their customers (retailers). Rush orders are costly to both parties because the supplier incurs higher production costs. We consider a situation where the supplier's production cost is reduced if the manufacturer can place some of its order in advance. In addition to the rush order contract with a pre‐established price, we examine whether the supplier should offer advance‐order discounts to encourage the manufacturer to place a portion of its order in advance, even though the manufacturer incurs some inventory risk. While the advance‐order discount contract is Pareto‐improving, our analysis shows that the discount contract cannot coordinate the supply chain. However, if the supplier imposes a pre‐specified minimum order quantity requirement as a qualifier for the manufacturer to receive the advance‐order discount, then such a combined contract can coordinate the supply chain. Furthermore, the combined contract enables the supplier to attain the first‐best solution. We also explore a delegation contract that either party could propose. Under this contract, the manufacturer delegates the ordering and salvaging activities to the supplier in return for a discounted price on all units procured. We find the delegation contract coordinates the supply chain and is Pareto‐improving. We extend our analysis to a setting where the suppliers capacity is limited for advance production but unlimited for rush orders. Our structural results obtained for the one‐supplier‐one‐manufacturer case continue to hold when we have two manufacturers.     

Long‐Term Contracting: The Role of Private Information in Dynamic Supply Risk Management

We examine the critical role of evolving private information in managing supply risk. The problem features a dyadic channel where a dominant buyer operates a multiperiod inventory system with lost sales and fixed cost. He replenishes from a supplier, whose private state of production is vulnerable to random shocks and evolves dynamically over time. We characterize the optimal inventory policy with a simple semi‐stationary structure; it distorts order quantity for limiting information rent only in the initial period; the optimal payment compensates for production cost in every period but concedes real information rent only in the initial period. These properties allow us to derive an easy‐to‐implement revenue‐sharing contract that facilitates ex ante strategic planning and ex post dynamic execution. This work advances our understanding on when and how to use private information in dynamic risk management.     

The benefit of receding horizon control: Near-optimal policies for stochastic inventory control

In this paper we address the single-item, single-stocking point, non-stationary stochastic lot-sizing problem under backorder costs. It is well known that the (s, S) policy provides the optimal control for such inventory systems. However the computational difficulties and the nervousness inherent in (s, S) paved the way for the development of various near-optimal inventory control policies. We provide a systematic comparison of these policies and present their expected cost performances. We further show that when these policies are used in a receding horizon framework the cost performances improve considerably and differences among policies become insignificant.     

Decision Support System of Truck Routing and Refueling: A Dual‐Objective Approach

The variable‐route vehicle‐refueling problem (VRVRP) is a variant of the network‐flow problem which seeks, for a vehicle traveling from origin s to destination d, both the route and the refueling policy (sequence of fuel stations to use between s and d) that jointly minimize the fuel cost of operating the vehicle. Commercial‐grade decision support systems that solve the VRVRP are widely used by motor carriers, but they provide heuristic solutions only. Exact methods are available from the academic side, but because they focus on minimizing costs, they tend to cut fuel costs in exchange for increased vehicle miles (which can increase fuel consumptions and pollutants emission). We propose a new approach to the VRVRP that allows carriers to jointly seek the two possibly conflicting goals; minimizing fuel cost and vehicle miles. Computational testing shows that our approach (i) outperforms the commercial software products in both goals, and (ii) finds solutions that require significantly less vehicle miles than those given by the exact method proposed in the academic literature, without incurring unacceptable increases in fuel cost.     

Experimental Results Indicating Lattice‐Dependent Policies May Be Optimal for General Assemble‐To‐Order Systems

We consider an assemble‐to‐order (ATO) system with multiple products, multiple components which may be demanded in different quantities by different products, possible batch ordering of components, random lead times, and lost sales. We model the system as an infinite‐horizon Markov decision process under the average cost criterion. A control policy specifies when a batch of components should be produced, and whether an arriving demand for each product should be satisfied. Previous work has shown that a lattice‐dependent base‐stock and lattice‐dependent rationing (LBLR) policy is an optimal stationary policy for a special case of the ATO model presented here (the generalized M‐system). In this study, we conduct numerical experiments to evaluate the use of an LBLR policy for our general ATO model as a heuristic, comparing it to two other heuristics from the literature: a state‐dependent base‐stock and state‐dependent rationing (SBSR) policy, and a fixed base‐stock and fixed rationing (FBFR) policy. Remarkably, LBLR yields the globally optimal cost in each of more than 22,500 instances of the general problem, outperforming SBSR and FBFR with respect to both objective value (by up to 2.6% and 4.8%, respectively) and computation time (by up to three orders and one order of magnitude, respectively) in 350 of these instances (those on which we compare the heuristics). LBLR and SBSR perform significantly better than FBFR when replenishment batch sizes imperfectly match the component requirements of the most valuable or most highly demanded product. In addition, LBLR substantially outperforms SBSR if it is crucial to hold a significant amount of inventory that must be rationed.     

Contracting Under Vendor Managed Inventory Systems Using Holding Cost Subsidies

Vendor managed inventory systems are becoming increasingly popular. An important issue in implementing a vendor managed inventory scheme is the contracting terms that dictate the ownership of the inventory and the responsibility of inventory replenishment decisions. Thus the performance of a vendor managed system crucially depends on these terms and on how inventory‐related costs are shared in a supply chain. We consider a system where a manufacturer supplies a single product to a retailer who faces random demand in a competitive market. The retailer incurs a fixed cost per order, inventory holding cost, and a penalty cost for a stockout (unsatisfied demand is back‐ordered). Further, the manufacturer incurs a penalty cost when there is a stockout at the retailer and a fixed replenishment cost. We assume that the players are rational and act noncooperatively. We compare the performance of retailer managed inventory systems, where the retailer places orders and makes replenishment decisions, with vendor managed inventory systems, wherein the vendor or manufacturer makes inventory and replenishment decisions. Specifically, in the vendor managed inventory system, we propose and evaluate holding cost subsidy‐type contracts on inventories offered by the retailer to improve system performance. We evaluate this contract in the context of three widely used inventory systems—deterministic economic order quantity, continuous review (Q, r) policies, and periodic review policies—and show when such contracts may improve channel performance.     

Equilibrium Joining Strategies and Optimal Control of a Make‐to‐Stock Queue

We consider a make‐to‐stock, finite‐capacity production system with setup cost and delay‐sensitive customers. To balance the setup and inventory related costs, the production manager adopts a two‐critical‐number control policy, where the production starts when the number of waiting customers reaches a certain level and shuts down when a certain quantity of inventory has accumulated. Once the production is set up, the unit production time follows an exponential distribution. Potential customers arrive according to a Poisson process. Customers are strategic, i.e., they make decisions on whether to stay for the product or to leave without purchase based on their utility values, which depend on the production manager's control decisions. We formulate the problem as a Stackelberg game between the production manager and the customers, where the former is the game leader. We first derive the equilibrium customer purchasing strategy and system performance. We then formulate the expected cost rate function for the production system and present a search algorithm for obtaining the optimal values of the two control variables. We further analyze the characteristics of the optimal solution numerically and compare them with the situation where the customers are non‐strategic.     

Early Sales of Seasonal Products with Weather‐Conditional Rebates

Some retailers of seasonal products adopt weather‐conditional rebate programs to induce early sales and increase profits. In such promotions, customers who buy the product in an advance preselling period are offered rebates if a pre‐specified weather condition is realized during the later normal selling season. We investigate the potential benefits of these programs for retailers. We show that the weather‐conditional rebate program can increase sales by price discriminating among a customer's post‐purchase states. Taking advantage of the early sales, it can also reduce the inventory holding cost and ordering cost, and hence can increase the retailer's expected profits. In addition, we numerically investigate the sensitivity of the rebate program's effectiveness to the model parameters and illustrate its advantages over an advance‐discount policy.     

The Backroom Effect in Retail Operations

Traditional inventory models fail to take into account the dynamics between the retail sales floor and the backroom, commonly used by retailers for extra storage. When a replenishment order for a given item arrives at a retail store, it may not fit on the allocated shelf space, making backroom storage necessary. In this article, we introduce the backroom effect (BRE) as a consequence of misalignment of case pack size, shelf space, and reorder point. This misalignment results from the fragmented nature of inventory policy decision making in the retail industry and affects basic trade‐offs in inventory models. We specify conditions under which the BRE exists, quantify the expected amount of backroom inventory, derive an optimal short‐term inventory policy, and assess the impact of the BRE on the optimal inventory policy and total costs. Our results indicate that ignoring the BRE leads to artificially high reorder points and higher total costs. The paper concludes with a discussion of theoretical and managerial implications.