Economic Lot-Sizing with Remanufacturing Options

We study a production planning problem with remanufacturing. We provide the problemʹs general formulation and assess its computational complexity under various cost structures. We prove that the problem is NP-complete for general concavecost structures. When costs are linear, we obtain an O(T 3) algorithm based on transforming the problem into the transportation problem in a special way. Finally, we suggest linearizing costs as an alternative for solving the problem in the real world.