Multi-period lot-sizing with supplier selection: Structural results, complexity and algorithms

We consider a multi-period lot-sizing problem with multiple products and multiple suppliers. Demand is deterministic and time-varying. The objective is to determine order quantities to minimize the total cost over a finite planning horizon. This problem is strongly NP-hard. For a special case, we ex...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Operations research letters Ročník 49; číslo 4; s. 602 - 609
Hlavní autoři: Lin, Meichun, Huh, Woonghee Tim, Wan, Guohua
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.07.2021
Témata:
Algorithm
Computational complexity
Lot-sizing and scheduling
Supply chain
Supply chain
Lot-sizing and scheduling
Algorithm
Computational complexity
ISSN:0167-6377, 1872-7468
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í:We consider a multi-period lot-sizing problem with multiple products and multiple suppliers. Demand is deterministic and time-varying. The objective is to determine order quantities to minimize the total cost over a finite planning horizon. This problem is strongly NP-hard. For a special case, we extend the classical zero-inventory-ordering principle and solve it by dynamic programming. Based on this new extension, we also develop a heuristic algorithm for the general problem and computationally show that it works well.
ISSN:0167-6377
1872-7468
DOI:10.1016/j.orl.2021.05.013