View article

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.