Year-end Sale % OFF 
Abstract
The optimal inventory problem of a repairable K-out-of-N:G system is discussed. When a unit fails, it is repaired or discarded according to the extent of damage. Spare units are replenished at the replenishment times. The optimal inventory problem is to determine the number of spare units replenished at each replenishment time, which minimizes the total system cost constrained by system availability. This problem is formulated as a nonlinear integer programming problem. A new algorithm which is a modification of an algorithm proposed earlier by the authors is used for the problem.
Published Version
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.
