Abstract
We propose an extended model for dynamic multi-level lot sizing with general acyclic product structure and unconstrained resources (MLUR), including additional constraints on lot sizes and cumulative production. These allow for interactive decisions and flexible planning sequences. For three types of decisions we examine the space of feasible decisions, the main part being dedicated to single-product decisions. In order to be able to solve the single-product problems with the algorithm by Chen et al. ( Journal of Global Optimization, 4(4),397–413). We focus on the case where the decision space can be given by upper and lower bound constraints on lot sizes and cumulative production. We establish a characterization of this case as well as sufficient conditions of wide applicability and give algorithms to compute the bounds. As an application, we formulate a Lagrangean-based heuristic using a primal procedure with flexible planning sequence. Extensive testing on classical MLUR problems shows consistent improvement in solution quality compared with other heuristics.
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 callMore From: International Transactions in Operational Research
Disclaimer: 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.
