Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount

•We investigated a single item capacitated lot sizing problem with quantity discount.•We defined the concept of irregular orders in the optimal solution of the problem.•We developed two exact algorithms with polynomial time complexity and a heuristic. This study investigates the single-item capacita...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 134; s. 105373
Hlavní autoři:	Malekian, Yaser, Mirmohammadi, S. Hamid, Bijari, Mehdi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.10.2021 Pergamon Press Inc
Témata:	Algorithms All-units quantity discount Capacitated lot sizing problem Complexity Cost function Enumeration Heuristic methods Implicit enumeration algorithm Lot sizing Operations research Polynomial exact algorithm Polynomials Production costs Run time (computers) Solvers Polynomial exact algorithm All-units quantity discount Capacitated lot sizing problem Implicit enumeration algorithm
ISSN:	0305-0548, 1873-765X, 0305-0548
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!

Buďte první, kdo okomentuje tento záznam!