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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization letters Jg. 16; H. 2; S. 421 - 432
Hauptverfasser:	Arulselvan, Ashwin, Akartunalı, Kerem, van den Heuvel, Wilco
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2022
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!