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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
