Abstract
Complex technical systems are often hierarchically composed of exchangeable modules, which themselves may be composed of exchangeable submodules. The hierarchy of modules of such systems can be represented by trees. Defective systems are repaired in a supply depot system by exchanging the defective modules from a stock of spare parts. The exchanged defective modules are repaired for resupply. In this paper, a dynamic programming algorithm for optimizing the stocks of spare parts, under a budget constraint, is presented. The optimization criterion is the minimization of the backlog of entire systems at the supply depot system. An implementation of the algorithm is described and some illustrative examples are given.
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.
