Economic Evaluation of Systems that Expedite Inventory Information

Information delays exist when the most recent inventory information available to the Inventory Manager (IM) is dated. Such situations arise when it takes a while to process the demand data, count the inventory, and pass the results to the IM. We show that the optimal total inventory‐related cost decreases when the length of the information delay decreases. The amount of the decrease is an important datum for an IM interested in considering whether or not to invest in reducing the delay. The investment is required to finance design and acquisition of an information (collection and dissemination) system that can reduce the information delay. Such systems include phone calls, business meetings, and the use of information collection mechanisms such as radiofrequency identification tags.     

The Effects of Sharing Upstream Information on Product Rollover

The process of introducing new and phasing out old products is called product rollover. This paper considers a periodic‐review inventory system consisting of a manufacturer and a retailer, where the manufacturer introduces new and improved products over an infinite planning horizon using the solo‐roll strategy. We consider two scenarios: (1) the manufacturer does not share the upstream information about new‐product introduction with the retailer and (2) the manufacturer shares the information. For each scenario, we first derive the decentralized ordering policy and the system‐optimal ordering policy with given cost parameters. We then devise an optimal supply chain contract that coordinates the inventory system. We demonstrate that when the inventory system is coordinated, information sharing improves the performance of both supply chain entities. However, this may not be true if the inventory system is not coordinated. We also show that under the optimal contract, the manufacturer has no incentive to mislead the retailer about new‐product information in the information‐sharing model. When demand variability increases, information sharing adds more benefits to the coordinated supply chain. Our research provides insights about coordinating product, financial, and information flows in supply chains with product rollover.     

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.     

Sensing Abnormal Resource Flow Using Adaptive Limit Process Charts in a Complex Supply Network*

Supply networks are becoming increasingly complex with multiple overlapping relationships between firms that may span across industries. Consequently, inventory management is becoming more difficult as managers have to cope with variability in the supply flows that originate from different parts of the network. Managers that quickly sense abnormal flows may intervene and adapt their inventory policies in response to system changes. In this article, we present a framework for sensing abnormal flows originating within the upstream supply network of a focal organization. Our framework combines time series modeling with process charts to identify abnormal flow patterns in the incoming supply streams. It is a flexible framework that uses off‐the‐shelf technology to provide managers with a process that can be employed for monitoring multiple individual or aggregated data streams originating within any complex system such as complex adaptive supply networks. We illustrate our framework on four years of longitudinal supply data from the second largest food bank in the United States. We identify multiple instances of abnormal supply flows and validate our results through rigorous inventory analysis as well as field‐based expert interviews. We discuss the implications of our findings for inventory management in complex supply networks, both from academic and practitioner points of view.     

Integrality in Stochastic Inventory Models

We study several finite‐horizon, discrete‐time, dynamic, stochastic inventory control models with integer demands: the newsvendor model, its multi‐period extension, and a single‐product, multi‐echelon assembly model. Equivalent linear programs are formulated for the corresponding stochastic dynamic programs, and integrality results are derived based on the total unimodularity of the constraint matrices. Specifically, for all these models, starting with integer inventory levels, we show that there exist optimal policies that are integral. For the most general single‐product, multi‐echelon assembly system model, integrality results are also derived for a practical alternative to stochastic dynamic programming, namely, rolling‐horizon optimization by a similar argument. We also present a different approach to prove integrality results for stochastic inventory models. This new approach is based on a generalization we propose for the one‐dimensional notion of piecewise linearity with integer breakpoints to higher dimensions. The usefulness of this new approach is illustrated by establishing the integrality of both the dynamic programming and rolling‐horizon optimization models of a two‐product capacitated stochastic inventory control system.     

An Analysis of Dual‐Kanban Just‐In‐Time Systems in a Non‐Repetitive Environment

Recent advances in approaches and production technologies for the production of goods and services have made just‐in‐time (JIT) a strong alternative for use in intermittent and small batch production systems, especially when time‐based competition is the norm and a low inventory is a must. However, the conventional JIT system is designed for mass production with a stable master production schedule. This paper suggests supplementing the information provided by production kanbans with information about customer waiting lines to be used by operators to schedule production in each work‐station of intermittent and small batch production systems. This paper uses simulation to analyze the effect of four scheduling policy variables—number of kanbans, length of the withdrawal cycle, information about customer waiting lines, and priority rules on two performance measures—customer wait‐time and inventory. The results show that using information about customer waiting lines reduces customer wait‐time by about 30% while also reducing inventory by about 2%. In addition, the effect of information about customer waiting lines overshadows the effect of priority rules on customer wait‐time and inventory.     

The Effect of Demand–Supply Mismatches on Firm Risk

A supply chain management (SCM) system comprises many subsystems, including forecasting, order management, supplier management, procurement, production planning and control, warehousing and distribution, and product development. Demand–supply mismatches (DSMs) could indicate that some or all of these subsystems are not working as expected, creating uncertainties about the overall capabilities and effectiveness of the SCM system, which can increase firm risk. This article documents the effect of DSMs on firm risk as measured by equity volatility. Our sample consists of three different types of DSMs announced by publicly traded firms: production disruptions, excess inventory, and product introduction delays. We find that all three types of DSMs result in equity volatility increases. Over a 2‐year period around the announcement date, we observe mean abnormal equity volatility increases of 5.62% for production disruptions, 11.19% for excess inventory, and 6.28% for product introduction delays. Volatility increases associated with excess inventory are significantly higher than the increases associated with production disruptions and product introduction delays. Across all three types of DSMs, volatility changes are positively correlated with changes in information asymmetry. The results provide some support that volatility changes are also correlated with changes in financial and operating leverage.     

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.     

Inventory Management for Customers with Alternative Lead Times

It is common for suppliers operating in batch‐production mode to deal with patient and impatient customers. This paper considers inventory models in which a supplier provides alternative lead times to its customers: a short or a long lead time. Orders from patient customers can be taken by the supplier and included in the next production cycle, while orders from impatient customers have to be satisfied from the on‐hand inventory. We denote the action to commit one unit of on‐hand inventory to patient or impatient customers as the inventory‐commitment decision, and the initial inventory stocking as the inventory‐replenishment decision. We first characterize the optimal inventory‐commitment policy as a threshold type, and then prove that the optimal inventory‐replenishment policy is a base‐stock type. Then, we extend our analysis to models to consider cases of a multi‐cycle setting, a supply‐capacity constraint, and the on‐line charged inventory‐holding cost. We also evaluate and compare the performances of the optimal inventory‐commitment policy and the inventory‐rationing policy. Finally, to further investigate the benefits and pitfalls of introducing an alternative lead‐time choice, we use the customer‐choice model to study the demand gains and losses, known as demand‐induction and demand‐cannibalization effects, respectively.     

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.     

A Production–Inventory Model for a Push–Pull Manufacturing System with Capacity and Service Level Constraints

We study a hybrid push–pull production system with a two‐stage manufacturing process, which builds and stocks tested components for just‐in‐time configuration of the final product when a specific customer order is received. The first production stage (fabrication) is a push process where parts are replenished, tested, and assembled into components according to product‐level build plans. The component inventory is kept in stock ready for the final assembly of the end products. The second production stage (fulfillment) is a pull‐based assemble‐to‐order process where the final assembly process is initiated when a customer order is received and no finished goods inventory is kept for end products. One important planning issue is to find the right trade‐off between capacity utilization and inventory cost reduction that strives to meet the quarter‐end peak demand. We present a nonlinear optimization model to minimize the total inventory cost subject to the service level constraints and the production capacity constraints. This results in a convex program with linear constraints. An efficient algorithm using decomposition is developed for solving the nonlinear optimization problem. Numerical results are presented to show the performance improvements achieved by the optimized solutions along with managerial insights provided.     

Hold Safety Inventory Before,At, or After the Fan‐Out Point?

We consider a product sold in multiple variants, each with uncertain demand, produced in a multi‐stage process from a standard (i.e., generic) sub‐assembly. The fan‐out point is defined as the last process stage at which outputs are generic (outputs at every subsequent stage are variant‐specific). Insights gained from an analytical study of the system are used to develop heuristics that determine the stage(s) at which safety inventory should be held. We offer a relatively‐simple heuristic that approaches globally‐optimal results even though it uses only two relatively‐local parameters. We call this the VAPT, or value‐added/processing time heuristic, because it determines whether a (local) stage should hold inventory based only on the value added at that local stage relative to its downstream stage, along with the processing time at that local stage relative to its downstream stage. Another key insight is that, contrary to possible intuition, safety inventory should not always be held at the fan‐out point, although a fan‐out point does hold inventory under a wider range of conditions. We also explore when postponement is most valuable and illustrate that postponement may often be less beneficial than suggested by Lee and Tang (1997).     

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.     

The Effect of Distribution Processes on Replenishment Lead Time and Inventory

We investigate the interrelationship of distribution center picking policies and supply chain inventory performance. In particular, we show how the picking sequence in the upstream supply chain link affects the inventory levels of items being replenished to a downstream link for a common “ship‐when‐full” trailer dispatching policy. Perturbing the picking sequence affects items’ inventory levels asymmetrically which causes the aggregate system inventory to vary. We separate the items in replenishment into those units in transit and those awaiting shipment from the upstream distribution step: we call the latter the residual replenishment. We show that the process governing aggregate residual replenishment is Markov and has a stationary distribution that is discrete uniform. Computing the item‐level residual distribution is intractable and so we develop analytical models from which we derive hypotheses for the effectiveness of stable vs. random picking sequences, how item residual replenishment varies with stable picking sequences, and how the aggregate inventory level changes with picking sequence. These suggest a heuristic sequencing algorithm for minimizing inventory, which performs well in simulation tests over a large testbed of parameter sets.     

MANAGING CYCLIC INVENTORIES

Cyclic inventory is the buffer following a machine that cycles over a set of products, each of which is subsequently consumed in a continuous manner. Scheduling such a machine is interesting when the changeover times from one product to another are non‐trivial—which is generally the case. This problem has a substantial literature, but the common practices of “lot‐splitting” and “maximization of utilization” suggest that many practitioners still do not fully understand the principles of cyclic inventory. This paper is a tutorial that demonstrates those principles. We show that cyclic inventory is directly proportional to cycle length, which in turn is directly proportional to total changeover time, and inversely proportional to machine utilization. We demonstrate the virtue of “maximum changeover policies” in minimizing cyclic inventory—and the difficulty in making the transition to an increased level of demand. In so doing, we explicate the different roles of cyclic inventory, transitional inventory, and safety stock. We demonstrate the interdependence of the products in the cycle—the lot‐size for one product cannot be set independently of the remaining products. We also give necessary conditions for consideration of improper schedules (i.e., where a product can appear more than once in the cycle), and demonstrate that both lot‐splitting and maximization of utilization are devastatingly counter‐productive when changeover time is non‐trivial.     

Inventory Control when the Lead‐time Changes

A single‐echelon inventory system with continuous review and Poisson demand is considered. There are standard linear holding and backorder costs but no ordering or set‐up costs. We study a change in the lead‐time, which is rather typical in connection with application of a Just‐In‐Time philosophy. Our main focus is a lead‐time decrease but we also consider a lead‐time increase. Due to the lead‐time change, the optimal steady state solution will also, in general, change. We consider the transient problem of minimizing the costs when bringing the system from its original steady state to the new steady state.     

End‐of‐Life Inventory Problem with Phaseout Returns

We consider the service parts end‐of‐life inventory problem of a capital goods manufacturer in the final phase of its life cycle. The final phase starts as soon as the production of parts terminates and continues until the last service contract expires. Final order quantities are considered a popular tactic to sustain service fulfillment obligations and to mitigate the effect of obsolescence. In addition to the final order quantity, other sources to obtain serviceable parts are repairing returned defective items and retrieving parts from phaseout returns. Phaseout returns happen when a customer replaces an old system platform with a next‐generation one and returns the old product to the original equipment manufacturer (OEM). These returns can well serve the demand for service parts of other customers still using the old generation of the product. In this study, we study the decision‐making complications as well as cost‐saving opportunities stemming from phaseout occurrence. We use a finite‐horizon Markov decision process to characterize the structure of the optimal inventory control policy. We show that the optimal policy consists of a time‐varying threshold level for item repair. Furthermore, we study the value of phaseout information by extending the results to cases with an uncertain phaseout quantity or an uncertain schedule. Numerical analysis sheds light on the advantages of the optimal policy compared to some heuristic policies.     

Why Do We Observe Stockless Operations on the Internet? Stockless Operations Under Competition

Due to the proliferation of electronic commerce and the development of Internet technologies, many firms have considered new pricing‐inventory models. In this paper, we study the role of stockless (i.e., zero‐inventory) operations in online retailing by a considering duopoly competition in which two retailers compete to maximize profit by jointly optimizing their pricing and inventory decisions. In our model, the retailers are allowed to choose either an in‐stock policy or stockless operations with a discounted price. We first present the characteristics and properties of the equilibrium. We then demonstrate that the traditional outcome of asymmetric Bertrand competition is observed under head‐to‐head competition. However, when the two firms choose different operational policies, with corresponding optimal pricing, they can share the market under certain conditions. Finally, we report interesting observations on the interaction between pricing and inventory decisions obtained from an extensive computational study.     

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.     

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.