Abstract
The problem of defining lot-sizes for single- product multi-stage assembly systems under various assumptions has received considerable attention in the literature. This paper compares several heuristic procedures with an optimal algorithm in the case of constant demand over an infinite horizon. A computational experiment shows a modified version of a well known heuristic to be promising for practical purposes.
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.
