Optimal Inventory Problem of a Repairable K-out-of-N:G System

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.