Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
The GI/M/1 queue with exponential vacations
Queueing Systems: Theory and Applications
Profit analysis of the M/Ek/1 machine repair problem with a non-reliable service station
Computers and Industrial Engineering
M/M/1 queues with working vacations (M/M/1/WV)
Performance Evaluation
M/G/1 queue with multiple working vacations
Performance Evaluation
Analysis of a GI/M/1 queue with multiple working vacations
Operations Research Letters
Journal of Computational and Applied Mathematics
Multi-server machine repair model with standbys and synchronous multiple vacation
Computers and Industrial Engineering
Computers and Industrial Engineering
Computational analysis of machine repair problem with unreliable multi-repairmen
Computers and Operations Research
Computers and Industrial Engineering
Hi-index | 7.29 |
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.