TY - JOUR

T1 - Economic lot-sizing problem with remanufacturing option

T2 - complexity and algorithms

AU - Arulselvan, Ashwin

AU - Akartunalı, Kerem

AU - van den Heuvel, Wilco

N1 - Funding Information: The work of first and second authors was supported by the US Air Force Office of Scientific Research (Grant Number FA9550-17-1-0105).
Publisher Copyright: © 2021, Crown.

PY - 2021/6/29

Y1 - 2021/6/29

N2 - In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period. The problem seeks a solution that determines how much to produce and carry at each time period, so that we will incur the least amount of production and inventory cost. When the remanufacturing option is included, the input comprises of number of returned products at each time period that can be potentially remanufactured to satisfy the demands, where remanufacturing and inventory costs are applicable. For this problem, we first show that it cannot have a fully polynomial time approximation scheme. We then provide a polynomial time algorithm, when we make certain realistic assumptions on the cost structure.

AB - In a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period. The problem seeks a solution that determines how much to produce and carry at each time period, so that we will incur the least amount of production and inventory cost. When the remanufacturing option is included, the input comprises of number of returned products at each time period that can be potentially remanufactured to satisfy the demands, where remanufacturing and inventory costs are applicable. For this problem, we first show that it cannot have a fully polynomial time approximation scheme. We then provide a polynomial time algorithm, when we make certain realistic assumptions on the cost structure.

UR - http://www.scopus.com/inward/record.url?scp=85109012663&partnerID=8YFLogxK

U2 - 10.1007/s11590-021-01768-3

DO - 10.1007/s11590-021-01768-3

M3 - Article

AN - SCOPUS:85109012663

VL - 16

SP - 421

EP - 432

JO - Optimization Letters

JF - Optimization Letters

SN - 1862-4472

IS - 2

ER -