Abstract

In a multi-product dynamic lot sizing problem, besides a separate minor setup cost for each product produced, a major setup cost is incurred when at least one product is produced in a period. The objective is to determine the product lot sizes, over a finite planning horizon, that will minimize the total relevant cost. A simple extension of the one-way-eyeballing-heuristic (OWEH) to a multi-product algorithm is given. Computational experience on realistically sized problems (30 products, 50 time periods) show inefficiency is about 10% of the optimum.

Full Text
Paper version not known

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.