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.
|Original language||English (US)|
|Number of pages||9|
|Journal||IIE Transactions (Institute of Industrial Engineers)|
|State||Published - 2001|
All Science Journal Classification (ASJC) codes
- Industrial and Manufacturing Engineering