Polynomial-time algorithms for deterministic uncapacitated lot-sizing problem with heterogeneous production cycles

In this study, we explore a unique deterministic uncapacitated lot-sizing problem with two products of distinct quality and production cycles. Either product can fulfill the demand, necessitating concurrent inventory tracking, and adding model complexity. We target cost reduction and maintain an ave...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research letters Jg. 61; S. 107304
Hauptverfasser:	Yu, Tan, Zhong, Xiang, Guan, Yongpei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.07.2025
Schlagworte:	Dynamic programming Heterogeneous production cycles Polynomial-time algorithm Uncapacitated lot-sizing problem Heterogeneous production cycles Polynomial-time algorithm Dynamic programming Uncapacitated lot-sizing problem
ISSN:	0167-6377
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this study, we explore a unique deterministic uncapacitated lot-sizing problem with two products of distinct quality and production cycles. Either product can fulfill the demand, necessitating concurrent inventory tracking, and adding model complexity. We target cost reduction and maintain an average quality level by optimizing ordering strategies. Incorporating multiple ordering properties into backward dynamic programming and the shortest path algorithm, we demonstrate finite value space enumeration and present an optimal algorithm with O(N4) complexity, where N denotes the number of planning horizon periods. The code is available at Github.
ISSN:	0167-6377
DOI:	10.1016/j.orl.2025.107304