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

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 th...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Optimization letters Ročník 16; číslo 2; s. 421 - 432
Hlavní autori: Arulselvan, Ashwin, Akartunalı, Kerem, van den Heuvel, Wilco
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022
Predmet:
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Polynomial algorithms
Lot-sizing
Remanufacturing
Complexity
ISSN:1862-4472, 1862-4480
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-021-01768-3