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

Ausführliche Beschreibung