Abstract
This paper presents a heuristic for the multi-item, multi-level dynamic lotsizing problem in general non-cyclic product/operation structures under multiple capacity constraints. The proposed procedure uses a modification of the Dixon-Silver heuristic to solve a sequence of single-level capacitated multi-item lotsizing problems (CLSP). Within the frame of this general procedure two costing methods and two ways of ordering the product/operation structure are considered. The heuristic is tested on a set of problems for which the optimal solution is a available.
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.
