Abstract
In this paper some recent results on the Discrete Lotsizing and Scheduling Problem (DLSP) are presented. DLSP tries to determine a feasible production schedule with minimal total costs for a single-stage multi-item manufacturing process by sequencing and sizing production lots for the items. Results presented are on computational complexity and algorithms for DLSP.
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.
