Myopic Analysis for Multi‐Echelon Inventory Systems with Batch Ordering and Nonstationary/Time‐Correlated Demands

We provide an exact myopic analysis for an N‐stage serial inventory system with batch ordering, linear ordering costs, and nonstationary demands under a finite planning horizon. We characterize the optimality conditions of the myopic nested batching newsvendor (NBN) policy and the myopic independent batching newsvendor (IBN) policy, which is a single‐stage approximation. We show that echelon reorder levels under the NBN policy are upper bounds of the counterparts under both the optimal policy and the IBN policy. In particular, we find that the IBN policy has bounded deviations from the optimal policy. We further extend our results to systems with martingale model of forecast evolution (MMFE) and advance demand information. Moreover, we provide a recursive computing procedure and optimality conditions for both heuristics which dramatically reduces computational complexity. We also find that the NBN problem under the MMFE faced by one stage has one more dimension for the forecast demand than the one faced by its downstream stage and that the NBN policy is optimal for systems with advance demand information and stationary problem data. Numerical studies demonstrate that the IBN policy outperforms on average the NBN policy over all tested instances when their optimality conditions are violated.     

Value of and Interaction between Production Postponement and Information Sharing Strategies for Supply Chain Firms

We analyze the value of and interaction between production postponement and information sharing, which are two distinct strategies to reduce manufacturers’ uncertainty about demand. In both single‐level and two‐level supply chains, from the manufacturer's perspective, while information sharing is always valuable, production postponement can sometimes be detrimental. Furthermore, the value of production postponement is not merely driven by savings in inventory holding cost as postponement enables the manufacturer to avoid both excess and shortfall in production. We find that production postponement and information sharing strategies may substitute, complement, or conflict with each other, depending on the extent of the increase in the unit production cost when production is postponed. In a two‐level supply chain, from the retailer's perspective, information sharing and production postponement can be beneficial or detrimental. When information sharing is beneficial to the retailer, the retailer always shares her demand information with the manufacturer voluntarily. In addition, this voluntary information sharing is truthful because inflated or deflated demand information hurts the retailer through a higher wholesale price or a stock‐out. However, the retailer never shares her demand information voluntarily if the manufacturer has already adopted production postponement because production postponement and information sharing strategies always conflict with each other. Even when the retailer does not benefit from information sharing, we show that the manufacturer can always design an incentive mechanism to induce the retailer to share the demand information, irrespective of whether the manufacturer has already implemented production postponement or not. The above findings underscore the need for a careful assessment of demand uncertainty‐reduction strategies before the supply chain players embark upon them.     

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.     

Order Progress Information: Improved Dynamic Emergency Ordering Policies

Technologies such as radio‐frequency identification and global positioning systems can provide improved real‐time tracking information for products and replenishment orders along the supply chain. We call this type of visibility order progress information. In this paper, we investigate how order progress information can be used to improve inventory replenishment decisions. To this end, we examine a retailer facing a stochastic lead time for order fulfillment. We characterize a replenishment policy that is based on the classical (Q, R) policy and that allows for releasing emergency orders in response to the order progress information. We show that the optimal structure of this policy is given by a sequence of threshold values dependent on order progress information. In a numerical study we evaluate the cost savings due to this improved replenishment policy.     

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.     

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.     

Developing a Human‐centred and Science‐based Approach to Design: The Knowledge Management Platform Project

The gap between theory and practice is a persistent problem in management and organization research. In this respect, several scholars have suggested that ‘design’ is an ideal‐typical form of mode 2 knowledge production. Design research develops knowledge in the service of action and problem solving in organizational settings. In this paper, we connect two perspectives on design that can be considered to be largely complementary but have hardly been combined and integrated in practice: science‐based design drawing on design propositions grounded in research and human‐centred design emphasizing an active and systematic participation by users and other stakeholders. An integrated approach that builds on both perspectives is developed and subsequently applied to designing and developing a portal for mapping competencies in an information technology cluster. This project involves creating problem awareness and articulating design propositions as well as developing scenarios of use, experimenting with prototypes, and organizational transformation. As such, this methodology addresses the dual challenge of rigour and relevance by producing both scientific and practical knowledge.     

Addressing Supply–Demand Imbalance: Designing Efficient Remanufacturing Strategies

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

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.     

Impact of Retailers with Knowledge of Supplier's Inventory on Supply Chain Performance

We model a supply chain consisting of a supplier and multiple retailers facing deterministic demand. We denote some retailers as strategic in the sense that given the supplier inventory information, they will implement the optimal stocking policy by incorporating such information. On the other hand, some retailers are denoted as naïve in the sense that they ignore supply information and resort to a simplistic ordering policy. Naïve retailers learn the optimal policy over time and adjust their orders accordingly. We study the dynamics of this game and investigate the impact of such strategic and naïve retailers on the cost, ordering pattern and stocking policies of all parties. We analyze the supply chain under two scenarios: the centralized supply chain where the objective is to minimize the total supply chain cost, and the decentralized supply chain where each self‐interested player minimizes its own cost in a Stackelberg game setting. We fully characterize the optimal policies under both centralized and decentralized scenarios and show that, surprisingly, the supply chain might be better off by virtue of naïve retailers. The result is driven by the fact that strategic and naïve players’ decisions shift the positioning of inventory in the supply chain with its final impact being determined by the relative costs of different retailer‐types. Our results also offer managerial insights into how access to supply information can improve supply chain performance.     

Consistent Estimation with a Large Number of Weak Instruments

This paper analyzes the conditions under which consistent estimation can be achieved in instrumental variables (IV) regression when the available instruments are weak and the number of instruments, K_n, goes to infinity with the sample size. We show that consistent estimation depends importantly on the strength of the instruments as measured by r_n, the rate of growth of the so‐called concentration parameter, and also on K_n. In particular, when K_n→∞, the concentration parameter can grow, even if each individual instrument is only weakly correlated with the endogenous explanatory variables, and consistency of certain estimators can be established under weaker conditions than have previously been assumed in the literature. Hence, the use of many weak instruments may actually improve the performance of certain point estimators. More specifically, we find that the limited information maximum likelihood (LIML) estimator and the bias‐corrected two‐stage least squares (B2SLS) estimator are consistent when , while the two‐stage least squares (2SLS) estimator is consistent only if K_n/r_n→0 as n→∞. These consistency results suggest that LIML and B2SLS are more robust to instrument weakness than 2SLS.     

Joint Initial Stocking and Transshipment—Asymptotics and Bounds

A common problem faced by many firms in their supply chains can be abstracted as follows. Periodically, or at the beginning of some selling season, the firm needs to distribute finished goods to a set of stocking locations, which, in turn, supply customer demands. Over the selling season, if and when there is a supply‐demand mismatch somewhere, a re‐distribution or transshipment will be needed. Hence, there are two decisions involved: the one‐time stocking decision at the beginning of the season and the supply/transshipment decision throughout the season. Applying a stochastic dynamic programming formulation to a two‐location model with compound Poisson demand processes, we identify the optimal supply/transshipment policy and show that the optimal initial stocking quantities can be obtained via maximizing a concave function whereas the contribution of transshipment is of order square‐root‐of T. Hence, in the context of high‐volume, fast‐moving products, the initial stocking quantity decision is a much more important contributor to the overall profit. The bounds also lead to a heuristic policy, which exhibits excellent performance in our numerical study; and we further prove both the bounds and the heuristic policy are asymptotically optimal when T approaches infinity. Extension to multiple locations is also discussed.     

Dynamic Supply Risk Management with Signal‐Based Forecast,Multi‐Sourcing,and Discretionary Selling

We examine the critical role of advance supply signals—such as suppliers’ financial health and production viability—in dynamic supply risk management. The firm operates an inventory system with multiple demand classes and multiple suppliers. The sales are discretionary and the suppliers are susceptible to both systematic and operational risks. We develop a hierarchical Markov model that captures the essential features of advance supply signals, and integrate it with procurement and selling decisions. We characterize the optimal procurement and selling policy, and the strategic relationship between signal‐based forecast, multi‐sourcing, and discretionary selling. We show that higher demand heterogeneity may reduce the value of discretionary selling, and that the mean value‐based forecast may outperform the stationary distribution‐based forecast. This work advances our understanding on when and how to use advance supply signals in dynamic risk management. Future supply risk erodes profitability but enhances the marginal value of current inventory. A signal of future supply shortage raises both base stock and demand rationing levels, thereby boosting the current production and tightening the current sales. Signal‐based dynamic forecast effectively guides the firm's procurement and selling decisions. Its value critically depends on supply volatility and scarcity. Ignoring advance supply signals can result in misleading recommendations and severe losses. Signal‐based dynamic supply forecast should be used when: (a) supply uncertainty is substantial, (b) supply‐demand ratio is moderate, (c) forecast precision is high, and (d) supplier heterogeneity is high.     

Revenue Management for Intermodal Transportation: The Role of Dynamic Forecasting

We study a joint capacity leasing and demand acceptance problem in intermodal transportation. The model features multiple sources of evolving supply and demand, and endogenizes the interplay of three levers—forecasting, leasing, and demand acceptance. We characterize the optimal policy, and show how dynamic forecasting coordinates leasing and acceptance. We find (i) the value of dynamic forecasting depends critically on scarcity, stochasticity, and volatility; (ii) traditional mean‐value equivalence approach performs poorly in volatile intermodal context; (iii) mean‐value‐based forecast may outperform stationary distribution‐based forecast. Our work enriches revenue management models and applications. It advances our understanding on when and how to use dynamic forecasting in intermodal revenue management.     

Level‐k Auctions: Can a Nonequilibrium Model of Strategic Thinking Explain the Winner's Curse and Overbidding in Private‐Value Auctions?

This paper proposes a structural nonequilibrium model of initial responses to incomplete‐information games based on “level‐k” thinking, which describes behavior in many experiments with complete‐information games. We derive the model's implications in first‐ and second‐price auctions with general information structures, compare them to equilibrium and Eyster and Rabin's (2005) “cursed equilibrium,” and evaluate the model's potential to explain nonequilibrium bidding in auction experiments. The level‐k model generalizes many insights from equilibrium auction theory. It allows a unified explanation of the winner's curse in common‐value auctions and overbidding in those independent‐private‐value auctions without the uniform value distributions used in most experiments.     

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.     

Sharp Identification Regions in Models With Convex Moment Predictions

We provide a tractable characterization of the sharp identification region of the parameter vector θ in a broad class of incomplete econometric models. Models in this class have set‐valued predictions that yield a convex set of conditional or unconditional moments for the observable model variables. In short, we call these models with convex moment predictions. Examples include static, simultaneous‐move finite games of complete and incomplete information in the presence of multiple equilibria; best linear predictors with interval outcome and covariate data; and random utility models of multinomial choice in the presence of interval regressors data. Given a candidate value for θ, we establish that the convex set of moments yielded by the model predictions can be represented as the Aumann expectation of a properly defined random set. The sharp identification region of θ, denoted Θ_I, can then be obtained as the set of minimizers of the distance from a properly specified vector of moments of random variables to this Aumann expectation. Algorithms in convex programming can be exploited to efficiently verify whether a candidate θ is in Θ_I. We use examples analyzed in the literature to illustrate the gains in identification and computational tractability afforded by our method.     

Information Acquisition and Voluntary Disclosure in an Export‐Processing System

We study a strategic information management problem in the export‐processing trade, where the buyer controls the raw material input and sales and the producer is responsible for production. The production is vulnerable to random yield risk. The producer can exert a costly effort to acquire the private yield rate information and discretionarily share it with the buyer. We develop a sequential Bayesian game model that captures three key features of the system—endogenous information endowment, voluntary disclosure, and ex post information sharing—a significant departure from the literature. The optimal disclosure strategy is driven by the trade‐off between the gains from Pareto efficiency improvement and self‐interested overproduction. It is specified by two thresholds on yield rate: only the middle‐yield producers (with yield rate between these two thresholds) share private information to improve supply‐demand match; the low‐ and high‐yield producers withhold information to extract excess input from the buyer. The buyer in response penalizes nondisclosure with reduced input and rewards information sharing with a larger order. This strategic interaction is further exacerbated by the double marginalization effect from decentralization, resulting in severe efficiency loss. We examine the effectiveness of three corrective mechanisms—vertical integration, mandatory disclosure, and production restriction—and reveal the costs of information suppressive effect and overinvestment incentive and the benefit from concessions on the processing fee. Our study endogenizes the asymmetric supply risk and provides the first attempt to rationalize the strategic interactions of informational and operational incentives in the export‐processing system.     

Dermal Uptake of 18 Dilute Aqueous Chemicals: In Vivo Disappearance‐Method Measures Greatly Exceed In Vitro‐Based Predictions

Average rates of total dermal uptake (K_up) from short‐term (e.g., bathing) contact with dilute aqueous organic chemicals (DAOCs) are typically estimated from steady‐state in vitro diffusion‐cell measures of chemical permeability (K_p) through skin into receptor solution. Widely used (“PCR‐vitro”) methods estimate K_up by applying diffusion theory to increase K_p predictions made by a physico‐chemical regression (PCR) model that was fit to a large set of K_p measures. Here, K_up predictions for 18 DAOCs made by three PCR‐vitro models (EPA, NIOSH, and MH) were compared to previous in vivo measures obtained by methods unlikely to underestimate K_up. A new PCR model fit to all 18 measures is accurate to within approximately threefold (r = 0.91, p < 10^?5), but the PCR‐vitro predictions (r > 0.63) all tend to underestimate the K_up measures by mean factors (UF, and p value for testing UF = 1) of 10 (EPA, p < 10^?6), 11 (NIOSH, p < 10^?8), and 6.2 (MH, p = 0.018). For all three PCR‐vitro models, log(UF) correlates negatively with molecular weight (r² = 0.31 to 0.84, p = 0.017 to < 10^?6) but not with log(vapor pressure) as an additional predictor (p > 0.05), so vapor pressure appears not to explain the significant in vivo/PCR‐vitro discrepancy. Until this discrepancy is explained, careful in vivo measures of K_up should be obtained for more chemicals, the expanded in vivo database should be compared to in vitro‐based predictions, and in vivo data should be considered in assessing aqueous dermal exposure and its uncertainty.     

Application of interactive possibilistic linear programming to aggregate production planning with multiple imprecise objectives

Aggregate production planning (APP) addresses matching supply to forecast demand, with varying customer orders over the intermediate planning horizon. In real-world APP problems, input data and related parameters are commonly imprecise because information is incomplete or unavailable, and the decision maker (DM) must simultaneously consider conflicting objectives. This study develops an interactive possibilistic linear programming (i-PLP) approach to solve multi-product and multi-time period APP problems with multiple imprecise objectives and cost coefficients by triangular possibility distributions in uncertain environments. The imprecise multi-objective APP model designed here seeks to minimise total production costs and changes in work-force level with reference to imprecise demand, cost coefficients, available resources and capacity. Additionally, the proposed i-PLP approach provides a systematic framework that helps the decision-making process to solve fuzzy multi-objective APP problems, enabling a DM to interactively modify the imprecise data and parameters until a set of satisfactory solutions is derived. An industrial case demonstrates the feasibility of applying the proposed approach to a practical multi-objective APP problem.