Abstract
The complexity of capacitated lotsizing problems is well known. The introduction of setup times and minimum lotsizes makes the problem even more complicated. To handle this complexity, we propose two heuristics based on an iterative procedure. An important feature of our approach is an MIP-based algorithm within a rolling horizon framework. The horizon is partitioned into several sub-horizons over which either a freezing strategy or a simplification strategy can be applied. This allows the relevant MIP model to be reduced, thereby limiting the computational load. To assess the performance of the proposed heuristics, various experiments are reported.
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.
