Multiple In‐Cycle Transshipments with Positive Delivery Times

We study a centralized inventory sharing system of two retailers that are replenished periodically. Between two replenishments, a unit can be transshipped to a stocked‐out retailer from the other. It arrives a transshipment time later, during which the stocked‐out retailer incurs backorder cost. Without transshipment, backorder cost is incurred until the next replenishment. Since the transshipment time is shorter than the time between two replenishments, transshipments can reduce the backorder cost at the stocked‐out retailer and the holding costs at the other retailer. The system is directed by a centralized inventory manager, who minimizes the long‐run average cost consisting of replenishment, holding, backorder, and transshipment costs. The transshipment policy is characterized by hold‐back inventory levels, which are nonincreasing in the remaining time until the next replenishment. The transshipment policy differs from those in the literature because we allow for multiple transshipments between replenishments, positive transshipment times, and backorder costs. We also discuss the challenges associated with positive replenishment time and develop upper and lower bounds of average cost in this case. Bounds are numerically shown to have an average gap of 1.1%. A heuristic solution is based on the upper bound and differs from the optimal cost by at most this gap.     

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.     

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.     

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.     

Analysis and Management of Periodic Review,Order‐Up‐To Level Inventory Systems with Order Crossover

In this article, we investigate the (R, S) periodic review, order‐up‐to level inventory control system with stochastic demand and variable leadtimes. Variable leadtimes can lead to order crossover, in which some orders arrive out of sequence. Most theoretical studies of order‐up‐to inventory systems under variable leadtimes assume that crossovers do not occur and, in so doing, overestimate the standard deviation of the realized leadtime distribution and prescribe policies that can inflate inventory costs. We develop a new analytic model of the expected costs associated with this system, making use of a novel approximation of the realized (reduced) leadtime standard deviation resulting from order crossovers. Extensive experimentation through simulation shows that our model closely approximates the true expected cost and can be used to find values of R and S that provide an expected cost close to the minimum cost. Taking account of, as opposed to ignoring, crossovers leads, on average, to substantial improvements in accuracy and significant cost reductions. Our results are particularly useful for managers seeking to reduce inventory costs in supply chains with variable leadtimes.     

A Bayesian Inventory Model Using Real‐Time Condition Monitoring Information

Lack of coordination between machinery fault diagnosis and inventory management for spare parts can lead to increased inventory costs and disruptions in production activity. We develop a framework for incorporating real‐time condition monitoring information into inventory decisions for spare parts. We consider a manufacturer who periodically replenishes inventory for a machine part that is subject to deterioration. The deterioration is captured via condition monitoring and modeled using a Wiener process. The resulting degradation model is used to derive the life distribution of a functioning part and to estimate the demand distribution for spare parts. This estimation is periodically updated, in a Bayesian manner, as additional information on part deterioration is obtained. We develop an inventory model that incorporates this updated demand distribution and demonstrate that a dynamic base‐stock policy, in which the optimal base‐stock level is a function of some subset of the observed condition monitoring information, is optimal. We propose a myopic critical fractile policy that captures the essence of the optimal policy, but is easier to compute. Computational experiments indicate that this heuristic performs quite well relative to the optimal policy. Adaptive inventory policies such as these can help manufacturers to increase machine availability and reduce inventory costs.     

Competing on Time: An Integrated Framework to Optimize Dynamic Time‐to‐Market and Production Decisions

This study develops a comprehensive framework to optimize new product introduction timing and subsequent production decisions faced by a component supplier. Prior to market entry, the supplier performs process design activities, which improve manufacturing yield and the chances of getting qualified for the customer's product. However, a long delay in market entry allows competitors to enter the market and pass the customer's qualification process before the supplier, reducing the supplier's share of the customer's business. After entering the market and if qualified, the supplier also needs to decide how much to produce for a finite planning horizon by considering several factors such as manufacturing yield and stochastic demand, both of which depend on the earlier time‐to‐market decision. To capture this dependency, we develop a sequential, nested, two‐stage decision framework to optimize the time‐to‐market and production decisions in relation to each other. We show that the supplier's optimal market entry and qualification timing decision need to be revised in real time based on the number of qualified competitors at the time of market‐entry decision. We establish the optimality of a threshold policy. Following this policy, at the beginning of each decision epoch, the supplier should optimally stop preparing for qualification and decide whether to enter the market if her order among qualified competitors exceeds a predetermined threshold. We also prove that the supplier's optimal production policy is a state‐dependent, base‐stock policy, which depends on the time‐to‐market and qualification decisions. The proposed framework also enables a firm to quantify how market conditions (such as price and competitor entry behavior) and operating conditions (such as the rate of learning and inventory/production‐related costs) affect time‐to‐market strategy and post‐entry production decisions.     

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.     

Priority Rules for Multi‐Task Due‐Date Scheduling under Varying Processing Costs

We study the scheduling of multiple tasks under varying processing costs and derive a priority rule for optimal scheduling policies. Each task has a due date, and a non‐completion penalty cost is incurred if the task is not completely processed before its due date. We assume that the task arrival process is stochastic and the processing rate is capacitated. Our work is motivated by both traditional and emerging application domains, such as construction industry and freelance consulting industry. We establish the optimality of Shorter Slack time and Longer remaining Processing time (SSLP) principle that determines the priority among active tasks. Based on the derived structural properties, we also propose an effective cost‐balancing heuristic policy and demonstrate the efficacy of the proposed policy through extensive numerical experiments. We believe our results provide operators/managers valuable insights on how to devise effective service scheduling policies under varying costs.     

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.     

Customer‐Base Concentration and Inventory Efficiencies: Evidence from the Manufacturing Sector

What is the link between customer‐base concentration and inventory efficiencies in the manufacturing sector? Using hand‐collected data from 10‐K Filings, we find that manufacturers with more concentrated customer bases hold fewer inventories for less time and are less likely to end up with excess inventories, as indicated by the lower likelihood and magnitude of inventory write‐downs and reversals. Using disaggregated inventory disclosures, we find that inventory efficiencies primarily flow through the finished goods inventory account, while raw material efficiencies are offset by higher work‐in‐process holdings and longer work‐in‐process cycles. In additional analysis, we document a valuation premium for more concentrated manufacturers after controlling for other firm characteristics, including default risk and cost of capital estimates. We conclude that investors trade off the costs and benefits of relationships with a limited number of major customers and, on balance, consider customer‐base concentration as a net positive for firm valuation. Overall, our study adds to interdisciplinary research in accounting and operations management by shedding new light on the relevance of major customer disclosures for fundamental analysis and valuation in the manufacturing sector.     

PRODUCT OFFERING,PRICING, AND MAKE‐TO‐STOCK/MAKE‐TO‐ORDER DECISIONS WITH SHARED CAPACITY

In an era of mass customization, many firms continue to expand their product lines to remain competitive. These broader product lines may help to increase market share and may allow higher prices to be charged, but they also cause challenges associated with diseconomies of scope. To investigate this tradeoff, we considered a monopolist who faces demand curves, which for each of its potential products, decline with both price and response time (time to deliver the product). The firm must decide which products to offer, how to price them, whether each should be make‐to‐stock (mts) or make‐to‐order (mto), and how often to produce them. The offered products share a single manufacturing facility. Setup times introduce disceonomies of scope and setup costs introduce economies of scale. We provide motivating problem scenarios, model the monopolist's problem as a non‐linear, integer programming problem, characterize of the optimal policy, develop near‐optimal procedures, and discuss managerial insights.     

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.     

Electricity Time‐of‐Use Tariff with Stochastic Demand

In this article, we study the electricity time‐of‐use (TOU) tariff for an electricity company with stochastic demand. The electricity company offers the flat rate (FR) and TOU tariffs to customers. Under the FR tariff, the customer pays a flat price for electricity consumption in both the peak and non‐peak periods. Under the TOU tariff, the customer pays a high price for electricity consumption in the peak period and a low price for electricity consumption in the non‐peak period. The electricity company uses two technologies, namely the base‐load and peak‐load technologies, to generate electricity. We derive the optimal capacity investment and pricing decisions for the electricity company. Furthermore, we use real data from a case study to validate the results and derive insights for implementing the TOU tariff. We show that in almost all the cases, the electricity company needs less capacity for both technologies under the TOU tariff than under the FR tariff, even though the expected demand in the non‐peak period increases. In addition, except for some extreme cases, there is essentially no signicant reduction in the total demand of the two periods, although the TOU tariff can reduce the demand in the peak period. Under the price‐cap regulation, the customer may pay a lower price on average under the TOU tariff than under the FR tariff. We conduct an extensive numerical study to assess the impacts of the model parameters on the optimal solutions and the robustness of the analytical results, and generate managerial implications of the research findings.     

Multi‐Echelon Inventory Management under Short‐Term Take‐or‐Pay Contracts

We extend the Clark–Scarf serial multi‐echelon inventory model to include procuring production inputs under short‐term take‐or‐pay contracts at one or more stages. In each period, each such stage has the option to order/process at two different cost rates; the cheaper rate applies to units up to the contract quantity selected in the previous period. We prove that in each period and at each such stage, there are three base‐stock levels that characterize an optimal policy, two for the inventory policy and one for the contract quantity selection policy. The optimal cost function is additively separable in its state variables, leading to conquering the curse of dimensionality and the opportunity to manage the supply chain using independently acting managers. We develop conditions under which myopic policies are optimal and illustrate the results using numerical examples. We establish and use a generic one‐period result, which generalizes an important such result in the literature. Extensions to cover variants of take‐or‐pay contracts are included. Limitations are discussed.     

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.     

Point‐of‐Use Hybrid Inventory Policy for Hospitals

Modern point‐of‐use technology at hospitals has enabled new replenishment policies for medical supplies. One of these new policies, which we call the hybrid policy, is currently in use at a large U.S. Midwest hospital. The hybrid policy combines a low‐cost periodic replenishment epoch with a high‐cost continuous replenishment option to avoid costly stockouts. We study this new hybrid policy under deterministic and stochastic demand. We develop a parameter search engine using simulation to optimize the long‐run average cost per unit time and, via a computational study, we provide insights on the benefits (reduction in cost, inventory, and number of replenishments) that hospitals may obtain by using the hybrid policy instead of the commonly used periodic policies. We also use the optimal hybrid policy parameters from the deterministic analysis to propose approximate expressions for the stochastic hybrid policy parameters that can be easily used by hospital management.      

Assemble‐to‐Order Inventory Management via Stochastic Programming: Chained BOMs and the M‐System

We study an inventory management mechanism that uses two stochastic programs (SPs), the customary one‐period assemble‐to‐order (ATO) model and its relaxation, to conceive control policies for dynamic ATO systems. We introduce a class of ATO systems, those that possess what we call a “chained BOM.” We prove that having a chained BOM is a sufficient condition for both SPs to be convex in the first‐stage decision variables. We show by examples the necessity of the condition. For ATO systems with a chained BOM, our result implies that the optimal integer solutions of the SPs can be found efficiently, and thus expedites the calculation of control parameters. The M system is a representative chained BOM system with two components and three products. We show that in this special case, the SPs can be solved as a one‐stage optimization problem. The allocation policy can also be reduced to simple, intuitive instructions, of which there are four distinct sets, one for each of four different parameter regions. We highlight the need for component reservation in one of these four regions. Our numerical studies demonstrate that achieving asymptotic optimality represents a significant advantage of the SP‐based approach over alternative approaches. Our numerical comparisons also show that outside of the asymptotic regime, the SP‐based approach has a commanding lead over the alternative policies. Our findings indicate that the SP‐based approach is a promising inventory management strategy that warrants further development for more general systems and practical implementations.     

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.     

An integrated vendor-buyer cooperative inventory model for items with imperfect quality

This article develops a model to determine an optimal integrated vendor-buyer inventory policy for flawed items in a just-in-time (JIT) manufacturing environment. The aim is to minimize the total joint annual costs incurred by the vendor and the buyer. The proposed model extends the integrated vendor-buyer inventory model by accounting for imperfect quality items. The expected annual integrated total cost function is derived and an analytic solution procedure is proposed to determine the optimal policy. Finally, numerical examples are also given to illustrate the solution procedure presented in this article.