A Closed Queueing Maintenance Network with Two Repair Centres

In this paper we introduce a model to determine the maintenance float needed to maximize the availability of an operating system with N number of circulating units. An implicit enumeration algorithm is used as a solution technique to the closed queueing maintenance network with two types of repairs: minor and major repairs. It is shown that when there is no differentiation of repair type, this special case is obtained as a by-product of the two-repair-centre model. This paper assumes exponential failure times and exponential repair times with load-independent servers. The approach followed in this paper provides an approximate and simple way to solve the maintenance-float problem of this complex closed-network system.