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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Operations research letters Ročník 61; s. 107304
Hlavní autoři:	Yu, Tan, Zhong, Xiang, Guan, Yongpei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.07.2025
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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