Strategic planning of a supply chain network is one of the most challenging aspects of reverse logistics. To effectively satisfy drivers such as profitability, environmental regulations and asset recovery, only the most economical used products must be reprocessed in only the recovery facilities that have the potential to efficiently reprocess them. Due to uncertainties in supply, quality and reprocessing times of used-products, the cost-benefit function in the literature that selects the most economical product to reprocess from a set of used-products is not appropriate for direct adoption. Moreover, due to the same uncertainties, any traditional forward supply chain approach to identify potential manufacturing facilities cannot be employed to identify potential recovery facilities. This paper proposes a three-phase mathematical programming approach, taking the above uncertainties into account, to completely design a reverse supply chain network. Application of the approach is detailed through an illustrative example in each phase.
Reverse Supply Chain, Disassembly
Industrial Engineering | Mechanical Engineering
(c) 2003 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Pochampally, Kishore K. and Gupta, Surendra M., "A multi-phase mathematical programming approach to strategic planning of an efficient reverse supply chain network" (2003). Mechanical and Industrial Engineering Faculty Publications. Paper 21. http://hdl.handle.net/2047/d20000303
Click button above to open, or right-click to save.COinS