Economic lot-sizing problem with remanufacturing option : complexity and algorithms

Arulselvan, Ashwin and Akartunali, Kerem and van den Heuvel, Wilco (2022) Economic lot-sizing problem with remanufacturing option : complexity and algorithms. Optimization Letters, 16 (2). 421–432. ISSN 1862-4472 (https://doi.org/10.1007/s11590-021-01768-3)

[thumbnail of Arulselvan-etal-OL-2021-Economic-lot-sizing-problem-with-remanufacturing-option]
Preview
 Text. Filename: Arulselvan_etal_OL_2021_Economic_lot_sizing_problem_with_remanufacturing_option.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (331kB)| Preview

Abstract

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 (FPTAS). We then provide a polynomial time algorithm, when we make certain realistic assumptions on the cost structure.

CORE (COnnecting REpositories)