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

Chia-Huang Wu, Jau Chuan Ke*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)2180-2189
Number of pages10
JournalApplied Mathematical Modelling
Volume38
Issue number7-8
DOIs
StatePublished - 1 Apr 2014

Keywords

  • Machine repair problem
  • Standby
  • Synchronous single vacation

Fingerprint

Dive into the research topics of 'Multi-server machine repair problems under a (V,R) synchronous single vacation policy'. Together they form a unique fingerprint.

Cite this