Multi-server machine repair problems under a (V,R) synchronous single vacation policy

Chia-Huang Wu, Jau Chuan Ke*


研究成果: Article同行評審

30 引文 斯高帕斯(Scopus)


This paper considers a machine repair problem with M operating machines and S standbys, in which R repairmen are responsible for supervising these machines and operate a (V,. R) vacation policy. With such policy, if the number of the failed machines is reduced to R. V (R>. V) (there exists V idle repairmen) at a service completion, these V idle servers will together take a synchronous vacation (or leave for other secondary job). Upon returning from the vacation, they do not take a vacation again and remain idle until the first arriving failed machine arrives. The steady-state probabilities are solved in terms of matrix forms and the system performance measures are obtained. Algorithmic procedures are provided to deal with the optimization problem of discrete/continuous decision variables while maintaining a minimum specified level of system availability.

頁(從 - 到)2180-2189
期刊Applied Mathematical Modelling
出版狀態Published - 1 4月 2014


深入研究「Multi-server machine repair problems under a (V,R) synchronous single vacation policy」主題。共同形成了獨特的指紋。