Lot sizing with minimum order quantity

Young Woong Park*, Diego Klabjan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Scopus citations

Abstract

We consider the single item lot sizing problem with minimum order quantity where each period has an additional constraint on minimum production quantity. We study special cases of the general problem from the algorithmic and mathematical programming perspective. We exhibit a polynomial case when capacity is constant and minimum order quantities are non-increasing in time. Linear programming extended formulations are provided for various cases with constant minimum order quantity.

Original languageEnglish (US)
Pages (from-to)235-254
Number of pages20
JournalDiscrete Applied Mathematics
Volume181
DOIs
StatePublished - Jan 30 2015

Keywords

  • Integer programming
  • LP extended formulation
  • Lot sizing
  • Minimum order quantity

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Lot sizing with minimum order quantity'. Together they form a unique fingerprint.

Cite this