Optimal Policies for Selling New and Remanufactured Products

Because of environmental and economic reasons, an increasing number of original equipment manufacturers (OEMs) nowadays sell both new and remanufactured products. When both products are available, customers will buy the one that gives them a higher (and non‐negative) utility. Thus, if the firm does not price the products properly, then product cannibalization may arise and its revenue may be adversely impacted. In this paper, we study the pricing problem of a firm that sells both new and remanufactured products over a finite planning horizon. Customer demand processes for both new and remanufactured products are random and price‐sensitive, and product returns (also called cores) are random and remanufactured upon receipt. We characterize the optimal pricing and manufacturing policies that maximize the expected total discounted profit. If new products are made‐to‐order (MTO), we show that when the inventory level of remanufactured product increases, the optimal price of remanufactured product decreases while the price difference between new and remanufactured products increases; however, the optimal selling price of new product may increase or decrease. If new products are made to stock (MTS), then the optimal manufacturing policy is of a base‐stock policy with the base‐stock level decreasing in the remanufactured product inventory level. To understand the potential benefit in implementing an MTO system, we study the difference between the value functions of the MTO and MTS systems, and develop lower and upper bounds for it. Finally, we study several extensions of the base model and show that most of our results extend to those more general settings.     

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.     

Managing a Remanufacturing System with Random Yield: Properties,Observations, and Heuristics

We study a remanufacturing system that involves the ordering of a serviceable product and the remanufacturing of multiple types of returned products (cores) into the serviceable product. In addition to random demand for the serviceable product and random returned quantities of different types of cores in each time period, the remanufacturing yield of each type of core is also uncertain. By analyzing a multi‐period stochastic dynamic program, we derive several properties of the optimal ordering/remanufacturing policy. In addition to some insights, these properties can be used to reduce the search effort of the optimal policy. We also demonstrate that some existing results derived from related models no longer hold in remanufacturing systems with random yield. Recognizing the optimal ordering/remanufacturing policy is highly complex, we examine three simple heuristics that can be efficiently solved and implemented in practice. Among these three heuristics, our numerical analysis suggests that the heuristic that captures most of the yield uncertainty and future system evolvement as well as some of the properties of the optimal ordering/remanufacturing policy outperforms the other two heuristics.     

The Role of Industry Studies and Public Policies in Production and Operations Management

The research domain Industry Studies and Public Policy (IS&PP) seeks to further our understanding of industrial practices and managerial challenges by explicitly considering contextual details in the design and interpretation of research studies. These details can be vital considerations when shaping public policies. This article reviews a sample of IS&PP publications and analyzes the content of 180 selected papers—85 papers published in the Production and Operations Management (POM) journal and 95 papers published in related journals between 1992 and 2014. Our analysis of the sample dataset and examination of exemplar papers provide four findings. First, studies in different industries emphasize different themes of operational decisions. This difference in emphasis reveals potential research opportunities, especially for conducting inter‐industry studies. Second, our analysis reveals a shift in focus over time. Earlier studies contain a mix of benchmarks and inter‐industry comparisons, while later studies tend to be context‐specific, intra‐industry studies. Third, we report on empirics → analytics → empirics cycles that reveal gaps for building novel theories. Finally, we observe that the relationship between POM decisions and public policy is bi‐directional. This highlights the need to jointly examine operational decisions with policy considerations, especially in information goods, healthcare, sustainable operations and high‐tech manufacturing industries.     

Dynamic Pricing and Inventory Management with Dual Suppliers of Different Lead Times and Disruption Risks

It is common for a firm to make use of multiple suppliers of different delivery lead times, reliabilities, and costs. In this study, we are concerned with the joint pricing and inventory control problem for such a firm that has a quick‐response supplier and a regular supplier that both suffer random disruptions, and faces price‐sensitive random demands. We aim at characterizing the optimal ordering and pricing policies in each period over a planning horizon, and analyzing the impacts of supply source diversification. We show that, when both suppliers are unreliable, the optimal inventory policy in each period is a reorder point policy and the optimal price is decreasing in the starting inventory level in that period. In addition, we show that having supply source diversification or higher supplier reliability increases the firm's optimal profit and lowers the optimal selling price. We also demonstrate that, with the selling price as a decision, a supplier may receive even more orders from the firm after an additional supplier is introduced. For the special case where the quick‐response supplier is perfectly reliable, we further show that the optimal inventory policy is of a base‐stock type and the optimal pricing policy is a list‐price policy with markdowns.     

Unsold Versus Unbought Commitment: Minimum Total Commitment Contracts with Nonzero Setup Costs

We study a minimum total commitment (MTC) contract embedded in a finite‐horizon periodic‐review inventory system. Under this contract, the buyer commits to purchase a minimum quantity of a single product from the supplier over the entire planning horizon. We consider nonstationary demand and per‐unit cost, discount factor, and nonzero setup cost. Because the formulations used in existing literature are unable to handle our setting, we develop a new formulation based on a state transformation technique using unsold commitment instead of unbought commitment as state variable. We first revisit the zero setup cost case and show that the optimal ordering policy is an unsold‐commitment‐dependent base‐stock policy. We also provide a simpler proof of the optimality of the dual base‐stock policy. We then study the nonzero setup cost case and prove a new result, that the optimal solution is an unsold‐commitment‐dependent (s, S) policy. We further propose two heuristic policies, which numerical tests show to perform very well. We also discuss two extensions to show the generality of our method's effectiveness. Finally, we use our results to examine the effect of different contract terms such as duration, lead time, and commitment on buyer's cost. We also compare total supply chain profits under periodic commitment, MTC, and no commitment.     

Dynamic Pricing and Inventory Management with Regular and Expedited Supplies

We consider a periodic‐review inventory system with regular and expedited supply modes. The expedited supply is faster than the regular supply but incurs a higher cost. Demand for the product in each period is random and sensitive to its selling price. The firm determines its order quantity from each supply in each period as well as its selling price to maximize the expected total discounted profit over a finite or an infinite planning horizon. We show that, in each period if it is optimal to order from both supplies, the optimal inventory policy is determined by two state‐independent thresholds, one for each supply mode, and a list price is set for the product; if only the regular supply is used, the optimal policy is a state‐dependent base‐stock policy, that is, the optimal base‐stock level depends on the starting inventory level, and the optimal selling price is a markdown price that decreases with the starting inventory level. We further study the operational impact of such supply diversification and show that it increases the firm's expected profit, reduces the optimal safety‐stock levels, and lowers the optimal selling price. Thus that diversification is beneficial to both the firm and its customers. Building upon these results, we conduct a numerical study to assess and compare the respective benefit of dynamic pricing and supply diversification.     

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.     

Looking Upstream: Optimal Policies for a Class of Capacitated Multi‐Stage Inventory Systems

We consider a multi‐stage inventory system with stochastic demand and processing capacity constraints at each stage, for both finite‐horizon and infinite‐horizon, discounted‐cost settings. For a class of such systems characterized by having the smallest capacity at the most downstream stage and system utilization above a certain threshold, we identify the structure of the optimal policy, which represents a novel variation of the order‐up‐to policy. We find the explicit functional form of the optimal order‐up‐to levels, and show that they depend (only) on upstream echelon inventories. We establish that, above the threshold utilization, this optimal policy achieves the decomposition of the multidimensional objective cost function for the system into a sum of single‐dimensional convex functions. This decomposition eliminates the curse of dimensionality and allows us to numerically solve the problem. We provide a fast algorithm to determine a (tight) upper bound on this threshold utilization for capacity‐constrained inventory problems with an arbitrary number of stages. We make use of this algorithm to quantify upper bounds on the threshold utilization for three‐, four‐, and five‐stage capacitated systems over a range of model parameters, and discuss insights that emerge.     

Production and Sales Planning in Capacitated New Product Introductions

How should a firm with limited capacity introduce a new product? Should it introduce the product as soon as possible or delay introduction to build up inventory? How do the product and market characteristics affect the firm's decisions? To answer such questions, we analyze new product introductions under capacity restrictions using a two‐period model with diffusion‐type demand. Combining marketing and operations management decisions in a stylized model, we optimize the production and sales plans of the firm for a single product. We identify four different introduction policies and show that when the holding cost is low and the capacity is low to moderate, a (partial) build‐up policy is indeed optimal if consumers are sensitive to delay. Under such a policy, the firm (partially) delays the introduction of its product and incurs short‐term backlog costs to manage its future demand and total costs more effectively. However, as either the holding cost or the capacity increases, or consumer sensitivity to delay decreases, the build‐up policy starts to lose its appeal, and instead, the firm prefers an immediate product introduction. We extend our analysis by studying the optimal capacity decision of the firm and show that capacity shortages may be intentional.     

Optimal Policies for a Two‐Product Inventory System under a Flexible Substitution Scheme

We study a two‐product inventory model that allows substitution. Both products can be used to supply demand over a selling season of N periods, with a one‐time replenishment opportunity at the beginning of the season. A substitution could be offered even when the demanded product is available. The substitution rule is flexible in the sense that the seller can choose whether or not to offer substitution and at what price or discount level, and the customer may or may not accept the offer, with the acceptance probability being a decreasing function of the substitution price. The decisions are the replenishment quantities at the beginning of the season, and the dynamic substitution‐pricing policy in each period of the season. Using a stochastic dynamic programming approach, we present a complete solution to the problem. Furthermore, we show that the objective function is concave and submodular in the inventory levels—structural properties that facilitate the solution procedure and help identify threshold policies for the optimal substitution/pricing decisions. Finally, with a state transformation, we also show that the objective function is ‐concave, which allows us to derive similar structural properties of the optimal policy for multiple‐season problems.     

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.     

生产性企业的概念性学习和操作性学习研究

本文用一个最优控制模型定量刻画了生产性企业计划期内的概念性学习和操作性学习与生产率、单位成本、废品率以及计划期内的总利润等生产经营指标之间的关系。模型的特点在于其能够规范地描绘众多变量之间的复杂关系。并简要阐述了由模型推导出的一些关于最优概念性学习和操作性学习策略的结论,详细分析了这些策略在生产性企业组织学习实践中的应用,获得了不同于传统理论的结果。     

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.     

Temptation and Taxation

We study optimal taxation when consumers have temptation and self‐control problems. Embedding the class of preferences developed by Gul and Pesendorfer into a standard macroeconomic setting, we first prove, in a two‐period model, that the optimal policy is to subsidize savings when consumers are tempted by “excessive” impatience. The savings subsidy improves welfare because it makes succumbing to temptation less attractive. We then study an economy with a long but finite horizon which nests, as a special case, the Phelps–Pollak–Laibson multiple‐selves model (thereby providing guidance on how to evaluate welfare in this model). We prove that when period utility is logarithmic, the optimal savings subsidies increase over time for any finite horizon. Moreover, as the horizon grows large, the optimal policy prescribes a constant subsidy, in contrast to the well known Chamley–Judd result.     

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.     

Inventory Policy with Parametric Demand: Operational Statistics,Linear Correction,and Regression

In this paper, we consider data‐driven approaches to the problem of inventory control. We first consider the approach of operational statistics and review related results which enable us to maximize a priori expected profit uniformly over all parameter values, when the demand distribution is known up to the location and scale parameters. For the case of the unknown shape parameter, we first suggest a heuristic approach based on operational statistics to obtain improved ordering policies and illustrate the same for the case of a Pareto demand distribution. In more general cases where the heuristic is not applicable, we suggest linear correction and support vector regression approaches to better estimate ordering policies, and illustrate these using a Gamma demand distribution. In certain cases, our proposed approaches are found to yield significant improvements.     

VMI环境下库存竞争性产品的补货策略及最优货架空间的确定

本文在文献[1]的研究基础上,通过深入剖析FKO模型,运用动态规划方法,探讨了呈现特殊需求性质的库存竞争性产品在VMI环境下的多期动态补货策略,以及传统库存管理中不加考虑的库存空间优化问题。本文一方面是对FKO模型的补充与扩展,同时也证实了对于在特定的VMI补货环境下采用多期库存盘查模式的供应商来说,封顶式的补货策略是最优的,并且其关于最优补货水平的多期决策都是无远见的。因此收益分享合同下的单期最优库存水平可以作为设定最优货架展示空间的依据。     

Application Development Using Fault Data

We develop a general model for software development process and propose a policy to manage system coordination using system fault reports (e.g., interface inconsistencies, parameter mismatches, etc.). These reports are used to determine the timing of coordination activities that remove faults. We show that under an optimal policy, coordination should be performed only if a “threshold” fault count has been exceeded. We apply the policy to software development processes and compare the management of those projects under different development conditions. A series of numerical experiments are conducted to demonstrate how the fault threshold policy needs to be adjusted to changes in system complexity, team skill, development environment, and project schedule. Moreover, we compare the optimal fault threshold policy to an optimal release‐based policy. The release‐based policy does not take into account fault data and is easier to administer. The comparisons help to define the range of project parameters for which observing fault data can provide significant benefits for managing a software project.     

Integrated Procurement Planning in Multi‐division Firms

For large multi‐division firms, coordinating procurement policies across multiple divisions to leverage volume discounts from suppliers based on firm‐wide purchasing power can yield millions of dollars of savings in procurement costs. Coordinated procurement entails deciding which suppliers to use to meet each division's purchasing needs and sourcing preferences so as to minimize overall purchasing, logistics, and operational costs. Motivated by this tactical procurement planning problem facing a large industrial products manufacturer, we propose an integrated optimization model that simultaneously considers both firm‐wide volume discounts and divisional ordering and inventory costs. To effectively solve this large‐scale integer program, we develop and apply a tailored solution approach that exploits the problem structure to generate tight bounds. We identify several classes of valid inequalities to strengthen the linear programming relaxation, establish polyhedral properties of these inequalities, and develop both a cutting‐plane method and a sequential rounding heuristic procedure. Extensive computational tests for realistic problems demonstrate that our integrated sourcing model and solution method are effective and can provide significant economic benefits. The integrated approach yields average savings of 7.5% in total procurement costs compared to autonomous divisional policies, and our algorithm generates near‐optimal solutions (within 0.75% of optimality) within reasonable computational time.