Search results for Mathematics

In this note we give a counterexample which shows that the µc-rule is not optimal in the second node of the tandem queue. This counterexample contradicts the interchange argument in Nain [1] and Nain et al. [2].

A generalization of the block replacement policy (BRP) is proposed and analysed. Under such a policy, an operating system is preventively replaced at times kT (k = 1, 2, 3, ···), independently of its failure history. At failure an operating system is either replaced by a new or a used one or minimally repaired or remains inactive until the next planned replacement. The cost of the ith minimal repair of the new subsystem at age y depends on the random part C(y) and the deterministic part ci(y). The mathematical model is defined and general analytical results are obtained.

90Bxx

Refine listing

Refine listing

Actions for selected content:

562 results in 90Bxx

The µc-rule is not optimal in the second node of the tandem queue: a counterexample

Optimal block replacement policies with multiple choice at failure

90Bxx

Refine listing

Refine listing

Actions for selected content:

Save Search

562 results in 90Bxx

The µc-rule is not optimal in the second node of the tandem queue: a counterexample

Optimal block replacement policies with multiple choice at failure