Abstract
We provide a formulation and solution algorithm for the finite-horizon capacitated production planning problem with random demand for multiple products. Using Lagrangian relaxation, we develop a subgradient optimization algorithm to solve this formulation. We also provide some computational results that indicate this approach works well for rolling-horizon planning compared with the rolling-horizon performance of the corresponding optimal finite-horizon solution. The advantage of our approach is that realistic problem instances can be solved quickly while optimal solutions to such instances are computationally intractable.
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.
