A Dynamic Programming Model for Disassembly and Reprocessing Lot-sizing in Remanufacturing Systems

초록

This study considers a dynamic lot-sizing problem for remanufacturing systems with a single disassembly and parallel reprocessing facilities. The problem is to determine the quantity and timing of disassembling products as well as the facilities, quantities and timings of reprocessing their components to satisfy the component demands over a given planning horizon for the objective of minimizing the sum of setup and inventory holding costs. A mixed integer programming model is developed, and then the optimal solution properties are derived after analyzing the problem. Using the optimal properties, the original mixed integer programming model is transformed into a dynamic programming model that can be used to solve the problem in polynomial time.

키워드