Abstract
This paper presents a mathematical formulation of a capacity constrained multistage inventory and production control problem. It argues that most practical multistage inventory and production control problems can be summarised in the formulation. The model has a strong connection to the model of Billington, McClain and Thomas (1983) and is also inspired of a paper from Bard and Golany (1991). The revised Billington/McClain/Thomas model is formulated in a dynamic programming recursion. A numerical solution to a simple problem is presented. A scheduling problem concerning capacity constrained models are enlightened. Further, the paper points to differences and relationships between this capacity constrained model, MRP, Kanban and Cover-Time Planning.
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.
