scholarly journals Equilibrium and optimal balking strategies of customers in Markovian queues with multiple vacations and N-policy

2016 ◽  
Vol 40 (1) ◽  
pp. 284-301 ◽  
Author(s):  
Wei Sun ◽  
Shiyong Li ◽  
Cheng-Guo E.
2020 ◽  
Vol 54 (3) ◽  
pp. 615-636 ◽  
Author(s):  
Wei Sun ◽  
Shiyong Li ◽  
Naishuo Tian

This paper mainly studies customers’ equilibrium balking behavior in Markovian queues with single vacation and geometric abandonments. Whenever the system becomes empty, the server begins a vacation. If it is still empty when the vacation ends, the server stays idle and waits for new arrivals. During a vacation, abandonment opportunities occur according to a Poisson process, and at an abandonment epoch, customers decide sequentially whether they renege and leave the system or not. We consider four information levels: the fully/almost observable cases and the almost/fully unobservable cases, and get the customers’ equilibrium balking strategies, respectively. Then we also get their optimal balking strategies for the almost observable and the almost/fully unobservable cases, and make comparisons of customer strategies and social welfare for the almost observable and the almost/fully unobservable queues with single vacation and multiple vacations. Because of abandonment, we find that the customers’ equilibrium threshold in a vacation may exceed the one in a busy period in the fully observable queues. However, it has little effect on their equilibrium threshold in the almost observable queues, although frequent abandonment opportunity arrival inhibits their optimal threshold. Interestingly, for the almost unobservable queues, customers who arrive in a busy period are not affected by reneging that happened in the previous vacation when they make decisions of joining or balking, whereas the social planner expects that the customers can take it into consideration for social optimization. In the fully unobservable queues, because of no information, possible reneging surely influences customers’ equilibrium and optimal balking behavior. For the almost observable and the almost/fully unobservable queues, the optimal social welfare is greater in the queues with single vacation than that in the queues with multiple vacations.


2012 ◽  
Vol 522 ◽  
pp. 902-909
Author(s):  
Bilikiz Yunus ◽  
Abdukerim Haji

We investigate the solution of the Gnedenko system with multiple vacation of a repairman. By using-semigroup theory of linear operators, we prove well-posedness and the existence of the unique positive dynamic solution of the system.


1994 ◽  
Vol 31 (02) ◽  
pp. 476-496
Author(s):  
Ho Woo Lee ◽  
Soon Seok Lee ◽  
Jeong Ok Park ◽  
K. C. Chae

We consider an Mx /G/1 queueing system with N-policy and multiple vacations. As soon as the system empties, the server leaves for a vacation of random length V. When he returns, if the queue length is greater than or equal to a predetermined value N(threshold), the server immediately begins to serve the customers. If he finds less than N customers, he leaves for another vacation and so on until he finally finds at least N customers. We obtain the system size distribution and show that the system size decomposes into three random variables one of which is the system size of ordinary Mx /G/1 queue. The interpretation of the other random variables will be provided. We also derive the queue waiting time distribution and other performance measures. Finally we derive a condition under which the optimal stationary operating policy is achieved under a linear cost structure.


Sign in / Sign up

Export Citation Format

Share Document