We consider a randomized policy to control the M/G/1 queueing system with an unreliable server, second optional service and general startup times. The server is subject to breaking down according to a Poisson process, and the repair time obeys a general distribution. All arrived customers demand the first required service, and only some of the arrived customers demand the second optional service. After all the customers are served in the system, the server immediately takes a vacation and operates the (T, p)-policy. For this queueing system, we employ maximum entropy approach with several constraints to develop the probability distributions of the system size and the expected waiting time in the queue. Based on the accuracy comparison between the exact and approximate methods, we show that the maximum entropy approach is quite accurate for practical purpose, which is a useful method for solving complex queueing systems.
|頁（從 - 到）||1717-1730|
|期刊||International Journal of Innovative Computing, Information and Control|
|出版狀態||Published - 1 三月 2012|