Answers are grounded in this paper and cite their sources.
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 concave-cost structures. When costs are linear, we obtain an 0(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.
No takes yet. Share an insight, caveat, or question.
Golany et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: