Applying Revenue Management to the Reverse Supply Chain

We study the disposition decision for product returns in a closed-loop supply chain. Motivated by the asset recovery process at IBM, we consider two disposition alternatives. Returns may be either refurbished for reselling or dismantled for spare parts. Reselling a refurbished unit typically yields higher unit margins. However, demand is uncertain. A common policy in many firms is to rank disposition alternatives by unit margins. We show that a revenue management approach to the disposition decision which explicitly incorporates demand uncertainty can increase profits significantly. We discuss analogies between the disposition problem and the classical airline revenue management problem. We then develop single period and multi-period stochastic optimization models for the disposition problem. Analyzing these models, we show that the optimal allocation balances expected marginal profits across the disposition alternatives. A detailed numerical study reveals that a revenue management approach to the disposition problem significantly outperforms the current practice of focusing exclusively on high-margin options, and we identify conditions under which this improvement is the highest. We also show that the value recovered from the returned products critically depends on the coordination between forward and reverse supply chain decisions.remanufacturing;revenue management;onderdelen;revenues;spare parts inventory

Optimal Decision Making for Capacitated Reverse Logistics Networks with Quality Variations

Increasing concerns about the environmental impact of production, product take-back laws and dwindling natural resources have heightened the need to address the impact of disposing end-of-life (EOL) products. To cope this challenge, manufacturers have integrated reverse logistics into their supply chain or chosen to outsource product recovery activities to third party firms. The uncertain quality of returns as well as uncertainty in return flow limit the effectiveness of planning, control and monitoring of reverse logistics networks. In addition, there are different recovery routes for each returned product such as reuse, repair, disassembling, remanufacturing and recycling. To determine the most profitable option for EOL product management, remanufacturers must consider the quality of returns and other limitations such as inventory size, demand and quantity of returns. The work in this dissertation addresses these pertinent aspects using two models that have been motivated by two remanufacturing facilities whereby there are uncertainties in the quality and quantity of return and capacitated inventories. In the first case, a disposition decision making model is developed for a remanufacturing process in which the inventory capacity of recoverable returns is limited and where there\u27s a constant demand to be met, for remanufactured products that meet a minimum quality threshold. It is assumed that the quality of returns is uncertain and remanufacturing cost is dependent on the quality grade. In this model, remanufacturing takes place when there is demand for remanufactured products. Accepted returns that meet the minimum quality threshold undergo the remanufacturing processes, and any unacceptable returns are salvaged. A continuous time Markov chain (CTMC) is presented as the modeling approach. The Matrix-Geometric solution methodology is applied to evaluate several key performance metrics for this system, to result in the optimal disposition policy. The numerical study shows an intricate trade-off between the acceptable quality threshold value and the recoverable product inventory capacity. Particularly, there are periodic system starvation whenever there is a mis-match between these two system metrics. In addition, the sensitivity analysis indicates that changes to the demand rate for remanufactured products necessitates the need to re-evaluate the existing system configuration. In the second case, a general framework is presented for a third party remanufacturer, where the remanufacturer has the alternative of salvaging EOL products and supplying parts to external suppliers, or remanufacture the disassembled parts to \u27as new\u27 conditions. The remanufacturing processes of reusable products and parts is studied in the context of other process variables such as the cost and demand of remanufactured products and parts. The goal of this model is to determine the return quality thresholds for a multi-product, multi-period remanufacturing setting. The problem is formulated as a mixed integer non-linear programming (MINLP) problem, which involves a discretization technique that turns the problem turns into a quadratic mixed integer programming (QMIP) problem. Finally, a numerical analysis using a personal computer (PC) remanufacturing facility data is used to test the extent to which the minimum acceptance quality threshold is dependent on the inventory level capacities of the EOL product management sites, varying operational costs and the upper bound of disposal rate

Service Level Constrained Inventory Systems

Peer Reviewedhttps://deepblue.lib.umich.edu/bitstream/2027.42/151878/1/poms13060_am.pdfhttps://deepblue.lib.umich.edu/bitstream/2027.42/151878/2/poms13060.pd

Modeling Industrial Lot Sizing Problems: A Review

In this paper we give an overview of recent developments in the field of modeling single-level dynamic lot sizing problems. The focus of this paper is on the modeling various industrial extensions and not on the solution approaches. The timeliness of such a review stems from the growing industry need to solve more realistic and comprehensive production planning problems. First, several different basic lot sizing problems are defined. Many extensions of these problems have been proposed and the research basically expands in two opposite directions. The first line of research focuses on modeling the operational aspects in more detail. The discussion is organized around five aspects: the set ups, the characteristics of the production process, the inventory, demand side and rolling horizon. The second direction is towards more tactical and strategic models in which the lot sizing problem is a core substructure, such as integrated production-distribution planning or supplier selection. Recent advances in both directions are discussed. Finally, we give some concluding remarks and point out interesting areas for future research

Quantitative models for reverse logistics

This article surveys the recently emerged field of reverse logistics. The management of return flows induced by the various forms of reuse of products and materials in industrial production processes has received growing attentio

Supply Chain and Revenue Management for Online Retailing

This dissertation focuses on optimizing inventory and pricing decisions in the online retail industry. Motivated by the importance of great customer service quality in the online retail marketplace, we investigate service-level-constrained inventory control problems in both static and dynamic settings. The first essay studies multi-period production planning problems (with or without pricing options) under stochastic demand. A joint service-level constraint is enforced to restrict the joint probability of having backorders in any period. We use the Sample Average Approximation (SAA) approach to reformulate both chance-constrained models as mixed-integer linear programs (MILPs). Via computations of diverse instances, we demonstrate the effectiveness of the SAA approach, analyze the solution feasibility and objective bounds, and conduct sensitivity analysis. The approaches can be generalized to a wide variety of production planning problems. The second essay investigates the dynamic versions of the service-level-constrained inventory control problems, in which retailers have the flexibility to adjust their inventory policies in each period. We formulate two periodic-review stochastic inventory models (backlogging model and remanufacturing model) via Dynamic Programs (DP), and establish the optimality of generalized base-stock policies. We also propose 2-approximation algorithms for both models, which is computationally more efficient than the brute-force DP. The core concept developed in our algorithms is called the delayed marginal cost, which is proven effective in dealing with service-level-constrained inventory systems. The third essay is motivated by the exploding use of sales rank information in today's internet-based e-commerce marketplace. The sales rank affects consumers' shopping preference and therefore, is critical for retailers to utilize when making pricing decisions. We study periodic-review dynamic pricing problems in presence of sales rank, in which customers' demand is a function of both prices and sales rank. We propose rank-based pricing models and characterize the structure and monotonicity of optimal pricing policies. Our numerical experiments illustrate the potential of revenue increases when strategic cyclic policy is used.PHDIndustrial & Operations EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttps://deepblue.lib.umich.edu/bitstream/2027.42/144159/1/ycjiang_1.pd

A review of discrete-time optimization models for tactical production planning

This is an Accepted Manuscript of an article published in International Journal of Production Research on 27 Mar 2014, available online: http://doi.org/10.1080/00207543.2014.899721[EN] This study presents a review of optimization models for tactical production planning. The objective of this research is to identify streams and future research directions in this field based on the different classification criteria proposed. The major findings indicate that: (1) the most popular production-planning area is master production scheduling with a big-bucket time-type period; (2) most of the considered limited resources correspond to productive resources and, to a lesser extent, to inventory capacities; (3) the consideration of backlogs, set-up times, parallel machines, overtime capacities and network-type multisite configuration stand out in terms of extensions; (4) the most widely used modelling approach is linear/integer/mixed integer linear programming solved with exact algorithms, such as branch-and-bound, in commercial MIP solvers; (5) CPLEX, C and its variants and Lindo/Lingo are the most popular development tools among solvers, programming languages and modelling languages, respectively; (6) most works perform numerical experiments with random created instances, while a small number of works were validated by real-world data from industrial firms, of which the most popular are sawmills, wood and furniture, automobile and semiconductors and electronic devices.This study has been funded by the Universitat Politècnica de València projects: ‘Material Requirement Planning Fourth Generation (MRPIV)’ (Ref. PAID-05-12) and ‘Quantitative Models for the Design of Socially Responsible Supply Chains under Uncertainty Conditions. Application of Solution Strategies based on Hybrid Metaheuristics’ (PAID-06-12).Díaz-Madroñero Boluda, FM.; Mula, J.; Peidro Payá, D. (2014). A review of discrete-time optimization models for tactical production planning. International Journal of Production Research. 52(17):5171-5205. doi:10.1080/00207543.2014.899721S51715205521

Assessing the benefits of remanufacturing option under one-way substitution and capacity constraint

In this article, we investigate the profitability of remanufacturing option when the manufactured and remanufactured products are segmented to different markets and the production capacity is finite. It is assumed that remanufactured products can be substituted by the manufactured ones. A single period profit model under substitution is constructed to investigate the system conditions under which remanufacturing is profitable. We present analytical findings and computational results to show profitability of remanufacturing option under substitution policy subject to a capacity constraint of the joint manufacturing/remanufactruing facility

Applying Revenue Management to the Reverse Supply Chain

We study the disposition decision for product returns in a closed-loop supply chain. Motivated by the asset recovery process at IBM, we consider two disposition alternatives. Returns may be either refurbished for reselling or dismantled for spare parts. Reselling a refurbished unit typically yields higher unit margins. However, demand is uncertain. A common policy in many firms is to rank disposition alternatives by unit margins. We show that a revenue management approach to the disposition decision which explicitly incorporates demand uncertainty can increase profits significantly. We discuss analogies between the disposition problem and the classical airline revenue management problem. We then develop single period and multi-period stochastic optimization models for the disposition problem. Analyzing these models, we show that the optimal allocation balances expected marginal profits across the disposition alternatives. A detailed numerical study reveals that a revenue management approach to the disposition problem significantly outperforms the current practice of focusing exclusively on high-margin options, and we identify conditions under which this improvement is the highest. We also show that the value recovered from the returned products critically depends on the coordination between forward and reverse supply chain decisions