Abstract

A single-product M facilities in-series production-planning model is analysed in which known demands on the last facility must be satisfied. The model considers concave production costs and piecewise concave inventory costs in the introduction of production capacity constraints. Backlogging of unsatisfied demand is permitted. The structure of optimal production schedules is exploited and then used to develop an efficient shortest-path algorithm for the systems with parallel production (inventory) cost functions. A numerical example is presented

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.