Strategic joining and information disclosing in Markovian queues with an unreliable server and working vacations

2020 ◽  
pp. 1-28
Author(s):  
Yu Zhang ◽  
Jinting Wang
Keyword(s):  
Unreliable Server ◽  
Markovian Queues ◽  
Working Vacations

scholarly journals Equilibrium and Optimal Strategies in M/M/1 Queues with Working Vacations and Vacation Interruptions

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Ruiling Tian ◽  
Linmin Hu ◽  
Xijun Wu
Keyword(s):  
Optimal Strategies ◽  
Cost Structure ◽  
Single Server ◽  
Equilibrium Strategies ◽  
Markovian Queues ◽  
Multiple Working Vacations ◽  
Working Vacations ◽  
System States ◽  
Partially Observable ◽  
Stationary Behavior

We consider the customers equilibrium and socially optimal joining-balking behavior in single-server Markovian queues with multiple working vacations and vacation interruptions. Arriving customers decide whether to join the system or balk, based on a linear reward-cost structure that incorporates their desire for service, as well as their unwillingness for waiting. We consider that the system states are observable, partially observable, and unobservable, respectively. For these cases, we first analyze the stationary behavior of the system and get the equilibrium strategies of the customers and compare them to socially optimal balking strategies numerically.

scholarly journals Equilibrium balking strategies in Markovian queues with working vacations

2013 ◽  
Vol 37 (16-17) ◽  
pp. 8264-8282 ◽  
Author(s):  
Feng Zhang ◽  
Jinting Wang ◽  
Bin Liu
Keyword(s):  
Markovian Queues ◽  
Working Vacations

scholarly journals Multi-Machine Repairable System with One Unreliable Server and Variable Repair Rate

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1299
Author(s):  
Shengli Lv
Keyword(s):  
Steady State ◽  
Transient State ◽  
Repairable System ◽  
Repair Rate ◽  
Numerical Illustration ◽  
Transform Method ◽  
Unreliable Server ◽  
Busy Time ◽  
The Mean ◽  
Mean Time

This paper analyzed the multi-machine repairable system with one unreliable server and one repairman. The machines may break at any time. One server oversees servicing the machine breakdown. The server may fail at any time with different failure rates in idle time and busy time. One repairman is responsible for repairing the server failure; the repair rate is variable to adapt to whether the machines are all functioning normally or not. All the time distributions are exponential. Using the quasi-birth-death(QBD) process theory, the steady-state availability of the machines, the steady-state availability of the server, and other steady-state indices of the system are given. The transient-state indices of the system, including the reliability of the machines and the reliability of the server, are obtained by solving the transient-state probabilistic differential equations. The Laplace–Stieltjes transform method is used to ascertain the mean time to the first breakdown of the system and the mean time to the first failure of the server. The case analysis and numerical illustration are presented to visualize the effects of the system parameters on various performance indices.

Sign in / Sign up

Export Citation Format

Share Document