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

Ashwin Arulselvan, Kerem Akartunali, Wilco van den Heuvel

Research output: Contribution to journalArticlepeer-review

3 Downloads (Pure)

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.
Original languageEnglish
Number of pages12
JournalOptimization Letters
Early online date29 Jun 2021
DOIs
Publication statusE-pub ahead of print - 29 Jun 2021

Keywords

  • lot-sizing
  • remanufacturing
  • complexity
  • polynomial algorithms

Fingerprint

Dive into the research topics of 'Economic lot-sizing problem with remanufacturing option: complexity and algorithms'. Together they form a unique fingerprint.

Cite this