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

Full description

Saved in:

Bibliographic Details
Published in:	Computers & operations research Vol. 134; p. 105373
Main Authors:	Malekian, Yaser, Mirmohammadi, S. Hamid, Bijari, Mehdi
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.10.2021 Pergamon Press Inc
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!