The linear dynamic lot size problem with minimum order quantity
Irena Okhrin and
International Journal of Production Economics, 2011, vol. 133, issue 2, 688-693
This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the cumulative demand structure allow us to develop a solution algorithm based on the concept of atomic sub-problems. We present an optimal solution to an atomic sub-problem in an explicit form and prove that it serves as a construction block for the optimal solution of the original problem. Computational tests and a comparison with a published algorithm confirm the efficiency of the solution algorithm developed here.
Keywords: Lot; sizing; problem; Minimum; order; quantity; Dynamic; programming (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5) Track citations by RSS feed
Downloads: (external link)
Full text for ScienceDirect subscribers only
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:eee:proeco:v:133:y:2011:i:2:p:688-693
Access Statistics for this article
International Journal of Production Economics is currently edited by R. W. GrubbstrÃ¶m
More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Haili He ().