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

محورهای موضوعی : فصلنامه ریاضی

Veena Goswami ¹ , P. Vijaya Laxmi ²

1 - KIIT University India Professor & Dean , School of Computer Application,KIIT University, Bhubaneswar
2 -

تاریخ دریافت : 1395/01/27 تاریخ پذیرش : 1395/01/27 تاریخ انتشار : 1394/01/01

کلید واژه: Cost, Queue, discrete-time, Triadic policy, Machine-repair, Quadratic ¯t search method,

چکیده مقاله :

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