Abstract

Abstract This paper discusses heuristics for the determination of lot-sizes in multi-stage systems, some based on current industrial practice, and gives computational times and solution values for the heuristic routines. These values are compared with optimal solutions derived from a dynamic programming formulation of the problem.

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 call

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.