Simple expressions for finding recovery system inventory control parameter values

In recent years considerable effort has been devoted to the development of inventory control models for joint manufacturing and remanufacturing. Optimality of control policies is analyzed and algorithms for the determination of parameter values have been developed. However, there is still a lack of formulae or algorithms that allow for an easy computation of optimal or near optimal policy parameter values. This paper addresses the problem of computing the produce-up-to level S and the remanufacture-up-to level M in a periodic review inventory control model. We provide simple formulae for the policy parameter values, which can easily be implemented within spreadsheet applications. The approach is to derive news-vendor-type formulae that are based on underage and overage cost considerations. We propose different formulae depending on whether lead times for production and remanufacturing are identical or not. A numerical study shows that the obtained solutions provide relatively small cost deviations compared to the optimal solution within the investigated class of inventory control policies.     

On the optimal control of manufacturing and remanufacturing activities with a single shared server

We consider a single-product make-to-stock manufacturing–remanufacturing system. Returned products require remanufacturing before they can be sold. The manufacturing and remanufacturing operations are executed by the same single server, where switching from one activity to another does not involve time or cost and can be done at an arbitrary moment in time. Customer demand can be fulfilled by either newly manufactured or remanufactured products. The times for manufacturing and remanufacturing a product are exponentially distributed. Demand and used products arrive via mutually independent Poisson processes. Disposal of products is not allowed and all used products that are returned have to be accepted. Using Markov decision processes, we investigate the optimal manufacture–remanufacture policy that minimizes holding, backorder, manufacturing and remanufacturing costs per unit of time over an infinite horizon. For a subset of system parameter values we are able to completely characterize the optimal continuous-review dynamic preemptive policy. We provide an efficient algorithm based on quasi-birth–death processes to compute the optimal policy parameter values. For other sets of system parameter values, we present some structural properties and insights related to the optimal policy and the performance of some simple threshold policies.     

Optimal policy and holding cost stability regions in a periodic review inventory system with manufacturing and remanufacturing options

In this paper a periodic review inventory model with finite horizon and remanufacturing, manufacturing options is studied. It is assumed that demand and cost parameters are constant and a sufficiently large quantity of used products is available at the beginning of the horizon. The model is studied within the class of policies with given remanufacturing and manufacturing set up and the optimal policy is obtained within this class. The policy specifies the period of switching from remanufacturing to manufacturing (switching period), the periods where remanufacturing and manufacturing activities take place and the corresponding lot sizes. An explicit formula for the cost function and some of its properties are established. Based on these, an algorithm which partitions the set of holding cost parameters into subsets, computes the optimal policy and constructs its corresponding stability regions on every such subset is proposed.     

Age-dependent production planning and maintenance strategies in unreliable manufacturing systems with lost sale

In this paper, we formulate an analytical model for the joint determination of an optimal age-dependent buffer inventory and preventive maintenance policy in a production environment that is subject to random machine breakdowns. Traditional preventive maintenance policies, such as age and periodic replacements, are usually studied based on simplified and non-realistic assumptions, as well as on the expected costs criterion. Finished goods inventories and the age-dependent likelihood of machine breakdowns are usually not considered. As a result, these policies could significantly extend beyond the anticipated financial incomes of the system, and lead to crises. In order to solve this problem, a more realistic analysis model is proposed in this paper to consider the effects of both preventive maintenance policies and machine age on optimal safety stock levels. Hence, a unified framework is developed, allowing production and preventive maintenance to be jointly considered. We use an age-dependent optimization model based on the minimization of an overall cost function, including inventory holdings, lost sales, preventive and corrective maintenance costs. We provide optimality conditions for the manufacturing systems considered, and use numerical methods to obtain an optimal preventive maintenance policy and the relevant age-dependent threshold level production policy. In this work, this policy is called the multiple threshold levels hedging point policy. We include numerical examples and sensitivity analyses to illustrate the importance and the effectiveness of the proposed methodology. Compared with other available optimal production and maintenance policies, the numerical solution obtained shows that the proposed age-dependent optimal production and maintenance policies significantly reduce the overall cost incurred.     

Optimal acquisition and production policy in a hybrid manufacturing/remanufacturing system with core acquisition at different quality levels

We study the acquisition and production planning problem for a hybrid manufacturing/remanufacturing system with core acquisition at two (high and low) quality conditions. We model the problem as a stochastic dynamic programming, derive the optimal dynamic acquisition pricing and production policy, and analyze the influences of system parameters on the acquisition prices and production quantities. The production cost differences among remanufacturing high- and low-quality cores and manufacturing new products are found to be critical for the optimal production and acquisition pricing policy: the acquisition price of high-quality cores is increasing in manufacturing and remanufacturing cost differences, while the acquisition price of low-quality cores is decreasing in the remanufacturing cost difference between high- and low-quality cores and increasing in manufacturing and remanufacturing cost differences; the optimal remanufacturing/manufacturing policy follows a base-on-stock pattern, which is characterized by some crucial parameters dependent on these cost differences.     

Heuristics with guaranteed performance bounds for a manufacturing system with product recovery

We consider a manufacturing system with product recovery. The system manufactures a new product as well as remanufactures the product from old, returned items. The items remanufactured with the returned products are as good as new and satisfy the same demand as the new item. The demand rate for the new item and the return rate for the old item are deterministic and constant. The relevant costs are the holding costs for the new item and the returned item, and the fixed setup costs for both manufacturing and remanufacturing. The objective is to determine the lot sizes and production schedule for manufacturing and remanufacturing so as to minimize the long-run average cost per unit time. We first develop a lower bound among all classes of policies for the problem. We then show that the optimal integer ratio policy for the problem obtains a solution whose cost is at most 1.5% more than the lower bound.     

Lot sizing for a single product recovery system with variable setup numbers

Inventory systems for joint remanufacturing and manufacturing have recently received considerable attention. In such systems, used products are collected from customers and are kept at the recoverable inventory warehouse for future remanufacturing. In this paper a production–remanufacturing inventory system is considered, where the demand can be satisfied by production and remanufacturing. The cost structure consists of the EOQ-type setup costs, holding costs and shortage costs. The model with no shortage case in serviceable inventory is first studied. The serviceable inventory shortage case is discussed next. Both models are considered for the case of variable setup numbers of equal sized batches for production and remanufacturing processes. For these two models sufficient conditions for the optimal type of policy, referring to the parameters of the models, are proposed.     

Dynamic pricing of remanufacturable products under demand substitution: a product life cycle model

We consider a manufacturer who sells both the new and remanufactured versions of a product over its life cycle. The manufacturer’s profit depends crucially on her ability to synchronize product returns with the sales of the remanufactured product. This gives rise to a challenging dynamic optimization problem where the size of both the market and the user pool are dynamic and their current values depend on the entire history. We provide an analytical characterization of the manufacturer’s optimal pricing, production, and inventory policies which lead to a practical threshold policy with a small optimality gap. In addition, our analysis offers a number of interesting insights. First, the timing of remanufacturing activity and its co-occurrence with new product manufacturing critically depends on remanufacturing cost benefits, attractiveness of the remanufactured product and product return rate. Second, there is a small upward jump in the price of the new product when remanufacturing is introduced. Third, the manufacturer keeps the new product longer on the market as the cost of remanufacturing decreases. Fourth, partially satisfying demand for the remanufactured item is never optimal, i.e., it is satisfied either fully or not at all. Finally, user pool and inventory of returned products are substitutes in ensuring the supply for future remanufacturing.     

Inventory strategies for systems with fast remanufacturing

We describe hybrid manufacturing/remanufacturing systems with a long lead time for manufacturing and a short lead time for remanufacturing. We review the classes of inventory strategies for hybrid systems in the literature. These are all based on equal lead times. For systems with slow manufacturing and fast remanufacturing, we propose a new class. An extensive numerical experiment shows that the optimal strategy in the new class almost always performs better and often much better than the optimal strategies in all other classes.     

Optimal batch sizing in a multi-stage production system with rework consideration

In a production system, rework process plays an important role in eliminating waste and effectively controlling the cost of manufacturing. Determining the optimal batch size in a system that allows for rework is, therefore, a worthwhile objective to minimize the inventory cost of work-in-processes and the finished goods. In this paper, models for the optimum batch quantity in a multi-stage system with rework process have been developed for two different operational policies. Policy 1 deals with the rework within the same cycle with no shortage and policy 2 deals with the rework done after N cycles, incurring shortages in each cycle. The major components that play a role in minimizing this cost of the system are manufacturing setups, work-in-processes, storage of finished goods, rework processing, waiting-time, and penalty costs to discourage the generation of defectives. The mathematical structure of this rework processing model falls under a nonlinear convex programming problems for which a closed-form solution has been proposed and results are demonstrated through numerical examples, followed by sensitivity analyses of different important parameters. It is concluded that the total cost in policy 2 tends to be smaller than that in policy 1 at lower proportion of defectives if the in-process carrying cost is low. Policy 2 may be preferred when the work-in-process carrying cost is low and the penalty cost is negligible.     

Optimal lateral transshipment policies for a two location inventory problem with multiple demand classes

We consider an inventory model for spare parts with two stockpoints, providing repairable parts for a critical component of advanced technical systems. As downtime costs for these systems are expensive, ready–for–use spare parts are kept in stock to be able to quickly respond to a breakdown of a system. We allow for lateral transshipments of parts between the stockpoints upon a demand arrival. Each stockpoint faces demands from multiple demand classes. We are interested in the optimal lateral transshipment policy. There are three ways in which a demand can by satisfied: from own stock, via a lateral transshipment, or via an emergency procedure. Using stochastic dynamic programming, we characterize and prove the structure of the optimal policy, that is, the policy for satisfying the demands which minimizes the average operating costs of the system. This optimal policy is a threshold type policy, with state-dependent thresholds at each stockpoint for every demand class. We show a partial ordering in these thresholds in the demand classes. In addition, we derive conditions under which the so-called hold back and complete pooling policies are optimal, two policies that are often assumed in the literature. Furthermore, we study several model extensions which fit in the same modeling framework.     

Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing

We study the economic lot scheduling problem with two production sources, manufacturing and remanufacturing, for which operations are performed on separate, dedicated lines. We develop an exact algorithm for finding the optimal common-cycle-time policy. The algorithm combines a search for the optimal cycle time with a mixed integer programming (MIP) formulation of the problem given a fixed cycle time. Using case study data from an auto part producer, we perform a sensitivity study on the effects of key problem parameters such as demand rates and return fractions. Furthermore, by comparing to results in Tang and Teunter [Tang, O., Teunter, R.H., 2006. Economic lot scheduling problem with returns. Production and Operations Management] for the situation where all operations are performed on the same line, we analyze the cost benefits of using dedicated lines.     

回收率依赖回收产品质量的再制造EOQ模型

研究回收率依赖回收产品质量情况下制造/再制造混合系统的EOQ模型.该模型假设顾客的需求可通过新产品的制造和回收产品的再制造两种方式满足,且这两种产品无质量差异;需求率是确定的、连续的;总成本包括制造和再制造的固定启动成本,可销售产品和回收品的库存成本,以及缺货成本.当假设缺货成本无限大时给出不允许缺货情况下的模型.给出算例验证模型的有效性.     

回收率依赖价格的再制造EPQ模型研究

研究了考虑回收率依赖于回收品价格,并带有废弃处理的制造和再制造混合系统的(1,R)和(M,1)EPQ模型.在模型中,采用新产品的制造和回收产品的再制造两种方式来满足客户的需要,回收产品部分用于再制造,其余作为废弃处理;总平均成本包括与回收产品、可销售产品有关的库存持有成本,与制造和再制造有关的生产成本和固定成本,与回收品及制造所需原材料的采购成本以及废弃处理成本.模型给出最优生产策略及总平均成本的表达式.算例验证了所建模型的计算方法,并分析了新引人决策变量p(回收产品单价占制造新产品所需原料价格的比例对总平均成本的变化率的影响.     

Joint control of production,remanufacturing, and disposal activities in a hybrid manufacturing–remanufacturing system

To generate insights into how production of new items and remanufacturing and disposal of returned products can be effectively coordinated, we develop a model of a hybrid manufacturing–remanufacturing system. Formulating the model as a Markov decision process, we investigate the structure of the optimal policy that jointly controls production, remanufacturing, and disposal decisions. Considering the average profit maximization criterion, we show that the joint optimal policy can be characterized by three monotone switching curves. Moreover, we show that there exist serviceable (i.e., as-new) and remanufacturing (i.e., returned) inventory thresholds beyond which production cannot be optimal but disposal is always optimal. We also identify conditions under which idling and disposal actions are always optimal when the system is empty. Using numerical comparisons between models with and without remanufacturing and disposal options, we generate insights into the benefit of utilizing these options. To effectively coordinate production, remanufacturing, and disposal activities, we propose a simple, implementable, and yet effective heuristic policy. Our extensive numerical results suggest that the proposed heuristic can greatly help firms to effectively coordinate their production, remanufacturing, and disposal activities and thereby reduce their operational costs.     

Competition for cores in remanufacturing

We study competition between an original equipment manufacturer (OEM) and an independently operating remanufacturer (IO). Different from the existing literature, the OEM and IO compete not only for selling their products but also for collecting returned products (cores) through their acquisition prices. We consider a two-period model with manufacturing by the OEM in the first period, and manufacturing as well as remanufacturing in the second period. We find the optimal policies for both players by establishing a Nash equilibrium in the second period, and then determine the optimal manufacturing decision for the OEM in the first period. This leads to a number of managerial insights. One interesting result is that the acquisition price of the OEM only depends on its own cost structure, and not on the acquisition price of the IO. Further insights are obtained from a numerical investigation. We find that when the cost benefits of remanufacturing diminishes and the IO has more chance to collect the available cores, the OEM manufactures less in the first period as the market in the second period gets larger to protect its market share. Finally, we consider the case where consumers have lower willingness to pay for the remanufactured products and find that in that case remanufacturing becomes less profitable overall.     

An effective heuristic for the review period in an inventory model with staggered deliveries and normal demands

Consider a single-item, periodic review, infinite-horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in JIT). Every T periods, one audits the stocks and chooses a delivery schedule for each of the next T periods, thus incurring a fixed audit cost and—when one schedules actual deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy minimizing the average cost. An earlier article developed an algorithm for computing an optimal T, and undertook a numerical study to evaluate various approximations. Assuming normal demands, we characterize the asymptotic behavior (for large μ/σ) of the optimal T and establish the asymptotic optimality of a heuristic, calculable on a spreadsheet. A numerical study indicates that patterns established here for large μ/σ hold for σ/μ above 2.     

The value of dynamic pricing for cores in remanufacturing with backorders

In remanufacturing, the supply of used products and the demand for remanufactured products are usually mismatched because of the great uncertainties on both sides. In this paper, we propose a dynamic pricing (DP) policy to balance this uncertain supply and demand. Specifically, we study a remanufacturer’s problem of pricing a single class of cores with random price-dependent returns and random demand for the remanufactured products with backlogs. We model this pricing task as a continuous-time Markov decision process, which addresses both the finite and infinite horizon problems, and provide managerial insights by analysing the structural properties of the optimal policy. We then use several computational examples to illustrate the impacts of particular system parameters on pricing policy and the benefit of DP. In addition, the models are extended to account for the price adjustment costs. We show through numerical example that the nice structural properties do not exist any longer, and find when DP is better than static pricing.     

A single-period inventory placement problem for a supply chain with the expected profit objective

Consider the expected profit maximizing inventory placement problem in an N-stage, supply chain facing a stochastic demand for a single planning period for a specialty item with a very short selling season. Each stage is a stocking point holding some form of inventory (e.g., raw materials, subassemblies, product returns or finished products) that after a suitable transformation can satisfy customer demand. Stocking decisions are made before demand occurs. Because of delays, only a known fraction of demand at a stage will wait for shipments. Unsatisfied demand is lost. The revenue, salvage value, ordering, shipping, processing, and lost sales costs are proportional. There are fixed costs for utilizing stages for stock storage. After characterizing an optimal solution, we propose an algorithm for its computation. For the zero fixed cost case, the computations can be done on a spreadsheet given normal demands. For the nonnegative fixed cost case, we develop an effective branch and bound algorithm.