A Single-Item Uncapacitated Lot-Sizing Problem with Remanufacturing and Outsourcing

作     者：Nengmin Wang Zhengwen He Jingchun Sun Haiyan Xie Wei Shi 

作者机构：Management School of Xi’an JiaoTong University 710049NO.28 Xiannin Road Xian Shaanxi China The key lab of the ministry of education for process control& efficiency engineering 710049NO.28 Xiannin Road Xian Shaanxi China College of Engineering and Information Technology University of Arkansas at Little Rock 2801S. University Ave. ETAS 202 Little Rock Arkansas 72204 USA 

出 版 物：《Procedia Engineering》 

年 卷 期：2011年第15卷

页      面：5170-5178页

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 

主　　题：Lot sizing remanufacturing outsource dynamic programming 

摘      要：This paper addresses the single-item, dynamic lot-sizing problem for systems with remanufacturing and outsourcing. Therein, demand and return amounts are deterministic over a finite planning horizon. Demand may be satisfied by the manufacturing of new items, remanufactured items, or outsourcing, but it cannot be backlogged. The objective of this study is to determine the lot sizes for manufacturing, remanufacturing, and outsourcing that minimise the total cost, which consists of the holding costs for returns and manufactured/remanufactured products, setup costs, and outsourcing costs. The problems addressed in this paper are an extension of those addressed by Richter et al. (2000,and 2001), Teunter et al. (2006), and Aksen et al. (2003). In this paper, the separate setup costs scheme is considered, we propose a dynamic programming approach to derive the optimal solution in the case of large quantities of returned product. The complexity of this dynamic programming approach is O ( T 2 ), wherein T is the number of periods in the planning horizon.