TY - JOUR
T1 - Economic lot-sizing with remanufacturing options
AU - Golany, Boaz
AU - Yang, Jian
AU - Yu, Gang
N1 - Funding Information:
Gang Yu's research was supported in part by the National Natural Science Foundation of China under grant number 79928001, and by the FADRC grant and the special research grant from the University of Texas at Austin.
PY - 2001/11
Y1 - 2001/11
N2 - 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 O(T3) 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.
AB - 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 O(T3) 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.
UR - http://www.scopus.com/inward/record.url?scp=0035501881&partnerID=8YFLogxK
U2 - 10.1023/A:1010942502567
DO - 10.1023/A:1010942502567
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0035501881
SN - 0740-817X
VL - 33
SP - 995
EP - 1003
JO - IIE Transactions (Institute of Industrial Engineers)
JF - IIE Transactions (Institute of Industrial Engineers)
IS - 11
ER -
