Machine interference problem with warm spares, server vacations and exhaustive service
Performance Evaluation
Optimal management of the machine repair problem with working vacation: Newton's method
Journal of Computational and Applied Mathematics
Bayesian assessing for a repairable system with standby imperfect switching and reboot delay
International Journal of Systems Science
Mathematics and Computers in Simulation
Multi-server machine repair model with standbys and synchronous multiple vacation
Computers and Industrial Engineering
Computational analysis of machine repair problem with unreliable multi-repairmen
Computers and Operations Research
| Hi-index | 0.00 |
This study examines a warm-standby machine repair problem which involves a switching failure probability, reboot delay and a repair pressure coefficient. The machine repair problem has M operating machines with W warm standbys and R repairpersons. When all repairpersons are busy and waiting line is very long (heavy loading), the repairpersons increase their repair rate to reduce the queue length because of the pressure. This phenomenon is very common in many realistic service systems. A matrix-analytic method is adopted to develop a function of the steady-state expected profit per unit time. The probabilistic global search Lausanne (PGSL) method is employed to determine the joint optimal parameter values that maximize the profit and satisfy the availability constraint. Some numerical results of various system performance measures under optimal operating conditions are presented. Finally, several managerial insights are provided by demonstrating an example of the application to assist system analysts for decision making.