Abstract
Although there is a significant amount of literature on the capacitated lot sizing problem, there has been insufficient consideration of planning problems in which it is possible for a lot size, or production run, to continue over consecutive time periods without incurring multiple setups. While there are papers that consider this feature, they typically restrict production to at most one product in each period. We present a set of mixed integer linear programs for the capacitated lot sizing problem that incorporate setup carry-over without restricting the number of products produced in each time period. Efficient reformulations are developed for finding optimal solutions, and a Lagrangian decomposition heuristic is provided that quickly generates near-optimal solutions. The computational results demonstrate that incorporating setup carry-over has a significant effect on both cost and lot sizes.
Sign-in/Register to access full text options 
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.
