We consider a Markovian clearing queueing system with setup times. When the system is empty, the server gets into the state of vacation. Once a new customer arrives the system, an exponential setup time is required before the server renders the service again. The customers are accumulated according to Poisson arrival process and the service times are exponentially distributed. Upon their arrivals, customers decide whether to join or balk the queue based on a natural linear reward-cost structure which reflects their desire for service and their unwillingness to wait. According to the state of server under some condition, we obtain the balking strategies of customers, the stationary distribution of system state, the expected queue length and the social optimal benefit. Finally, some numerical experiments describe how the expected queue length and the social optimal benefit depend on the arrival rate, the service time and the setup time.
Accepté le :
DOI : 10.1051/ro/2014035
Mots clés : Clearing system, setup times, dominant strategy, Nash equilibrium
@article{RO_2015__49_1_67_0, author = {Ma, Qing}, title = {Analysis of a clearing queueing system with setup times}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {67--76}, publisher = {EDP-Sciences}, volume = {49}, number = {1}, year = {2015}, doi = {10.1051/ro/2014035}, mrnumber = {3349116}, zbl = {1310.90028}, language = {en}, url = {http://www.numdam.org/articles/10.1051/ro/2014035/} }
TY - JOUR AU - Ma, Qing TI - Analysis of a clearing queueing system with setup times JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2015 SP - 67 EP - 76 VL - 49 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro/2014035/ DO - 10.1051/ro/2014035 LA - en ID - RO_2015__49_1_67_0 ER -
Ma, Qing. Analysis of a clearing queueing system with setup times. RAIRO - Operations Research - Recherche Opérationnelle, Tome 49 (2015) no. 1, pp. 67-76. doi : 10.1051/ro/2014035. http://www.numdam.org/articles/10.1051/ro/2014035/
Analysis of a multiserver queue with setup times. Queueing Syst. 52 (2005) 53–76. | DOI | MR | Zbl
, and ,Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes. Comput. Oper. Res. 39 (2012) 413–423. | DOI | MR | Zbl
and ,Analysis of M/G/1-Queues with setup times and vacations under six different service disciplines. Queueing Syst. 39 (2001) 265-301. | DOI | MR | Zbl
,Optimal and equilibrium balking strategies in the single server Markovian queue with catastrophes. Eur. J. Oper. Res. 218 (2012) 708–715. | DOI | MR | Zbl
and ,A batch arrival queue with a vacation time under single vacation policy. Comput. Oper. Res. 29 (2002) 1941–1955. | DOI | MR | Zbl
,Equilibrium balking strategies in the observable single-server queue with breakdowns and repairs. Oper. Res. Lett. 36 (2008) 696–699. | DOI | MR | Zbl
and ,Equilibrium balking strategies for a clearing queueing system in alternating environment. Ann. Oper. Res. 208 (2013) 489–514. | DOI | MR | Zbl
and ,Congestion tolls for poisson queuing processes. Econometrica 43 (1975) 81–92. | DOI | MR | Zbl
and ,Consumer information in markets with random products quality: the case of queues and balking. Econometrica 54 (1986) 1185–1195. | DOI | MR
,R. Hassin and M. Haviv, To queue or not to queue: Equilibrium behavior in queueing systems. Kluwer Academic Publishers (2003) 191p. | MR | Zbl
The regulation of queue size by levying tolls. Econometrica 37 (1969) 15–24. | DOI | Zbl
,N.Sh. Tian and Z.G. Zhang, Vacation queueing models, theory and applications. Springer (2006) 385p. | MR | Zbl
Equilibrium analysis of the observable queues with balking and delayed repairs. Appl. Math. Comput. 218 (2011) 2716–2729. | MR | Zbl
and ,On optimal balking rules and toll charges in the GI/M/1 queue. Oper. Res. 19 (1971) 349–370. | DOI | MR | Zbl
,Cité par Sources :