Abstract
The main purpose of this article is to use the strong stability method to approximate the characteristics of the M/G/1//N queue with server vacation by those of the classical M/G/1//N queue, when the rate of the vacations is sufficiently small. This last queue is simpler and more exploitable in practice. For this, we proof the stability conditions and next obtain quantitative stability estimates with an exact computation of constants. From these theoretical results, we can develop an algorithm in order to check the conditions of approximation. These results of approximation have a great practical and economic interest in reliability systems and maintenance optimization policy, when we consider elements with constant failure rate.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
