Optimal management of the machine repair problem with working vacation: Newton's method

  • Authors:
  • Kuo-Hsiung Wang;Wei-Lun Chen;Dong-Yuh Yang

  • Affiliations:
  • Department of Applied Mathematics, National Chung-Hsing University, Taichung 402, Taiwan;Department of Applied Mathematics, National Chung-Hsing University, Taichung 402, Taiwan;Department of Industrial Engineering and Management, National Chiao Tung University, Hsinchu 30050, Taiwan

  • Venue:
  • Journal of Computational and Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 7.29

Visualization

Abstract

This paper studies the M/M/1 machine repair problem with working vacation in which the server works with different repair rates rather than completely terminating the repair during a vacation period. We assume that the server begins the working vacation when the system is empty. The failure times, repair times, and vacation times are all assumed to be exponentially distributed. We use the MAPLE software to compute steady-state probabilities and several system performance measures. A cost model is derived to determine the optimal values of the number of operating machines and two different repair rates simultaneously, and maintain the system availability at a certain level. We use the direct search method and Newton's method for unconstrained optimization to repeatedly find the global minimum value until the system availability constraint is satisfied. Some numerical examples are provided to illustrate Newton's method.