Affordable Access

Publisher Website

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

Authors
Journal
Applied Mathematical Modelling
0307-904X
Publisher
Elsevier
Volume
38
Identifiers
DOI: 10.1016/j.apm.2013.10.045
Keywords
  • Machine Repair Problem
  • Synchronous Single Vacation
  • Standby

Abstract

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.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Multi-server machine repair problems under a (V, R...

on Applied Mathematical Modelling Apr 01, 2014

Multi-server machine repair model with standbys an...

on Computers & Industrial Enginee... Jan 01, 2012

Multi-threshold policy for a multi-server queue wi...

on Mathematical and Computer Mode...

Analysis of multi-server queue with a single vacat...

on Performance Evaluation Jan 01, 2006
More articles like this..