ANALYSIS OF DISCRETE-TIME MACHINE REPAIR PROBLEM WITH TWO REMOVABLE SERVERS UNDER TRIADIC POLICY

Abstract

<span>This paper analyzes a controllable discrete-time machine repair problem with</span><br /><span>L operating machines and two repairmen. The number of working servers can be adjusted</span><br /><span>depending on the number of failed machines in the system one at a time at machine's failure or</span><br /><span>at service completion epochs. Analytical closed-form solutions of the stationary probabilities of</span><br /><span>the number of failed machines in the system are obtained. We develop the total expected cost</span><br /><span>function per machine per unit time and obtain the optimal operating policy and the optimal</span><br /><span>service rate at minimum cost using quadratic ¯t search method and simulated annealing</span><br /><span>method. Various performance measures along with numerical results to illustrate the in°uence</span><br /><span>of various parameters on the bu®er behavior are also presented.</span>