scispace - formally typeset
Open AccessJournal ArticleDOI

Equilibrium Customer Strategies in the Single-Server Constant Retrial Queue with Breakdowns and Repairs

Reads0
Chats0
TLDR
Nash equilibrium analysis for customers’ joining strategies as well as the related social and profit maximization problems is investigated and the effect of the information levels and several parameters on the customers�’ equilibrium and optimal strategies is presented.
Abstract
We consider a single-server constant retrial queueing system with a Poisson arrival process and exponential service and retrial times, in which the server may break down when it is working. The lifetime of the server is assumed to be exponentially distributed and once the server breaks down, it will be sent for repair immediately and the repair time is also exponentially distributed. There is no waiting space in front of the server and arriving customers decide whether to enter the retrial orbit or to balk depending on the available information they get upon arrival. In the paper, Nash equilibrium analysis for customers’ joining strategies as well as the related social and profit maximization problems is investigated. We consider separately the partially observable case where an arriving customer knows the state of the server but does not observe the exact number of customers waiting for service and the fully observable case where customer gets informed not only about the state of the server but also about the exact number of customers in the orbit. Some numerical examples are presented to illustrate the effect of the information levels and several parameters on the customers’ equilibrium and optimal strategies.

read more

Citations
More filters
Journal ArticleDOI

Equilibrium balking strategies in the single server queue with setup times and breakdowns

TL;DR: The equilibrium behavior of customers in the M/M/1 queue with setup times, breakdowns and repairs is studied to illustrate the effect of the information levels and several parameters on the customers’ equilibrium and optimal strategies.
Journal ArticleDOI

Equilibrium customer behavior in the M/M/1 retrial queue with working vacations and a constant retrial rate

TL;DR: This paper derives the closed form solution for the stationary probabilities of the queue with working vacations and a constant retrial rate and concludes that the social benefit rate is best when customers know all information about the server.
Journal ArticleDOI

Preventive maintenance in an unreliable M/G/1 retrial queue with persistent and impatient customers

TL;DR: A new version of an unreliable retrial queue with persistent and impatient customers with corrective and preventive maintenances is studied and some performance measures are derived.
Journal ArticleDOI

Social and Monopoly Optimization in Observable Queues

TL;DR: In service systems, customers are often reluctant to join overly crowded systems, so monopolies resulting in outputs lower and prices higher than socially desirable are more likely.
Journal ArticleDOI

Equilibrium balking strategies in the single-server retrial queue with constant retrial rate and catastrophes

TL;DR: It is found that customers in the M/M/1 retrial queueing system with constant retrial rate and Poisson generated catastrophes incur a lower waiting cost, which results in the fact that customers will receive more benefit and they are more inclined to join the system with catastropheses.
References
More filters
Book

Retrial Queueing Systems: A Computational Approach

TL;DR: This book is intended for an audience ranging from advanced undergraduates to researchers interested in queueing theory, but also in applied probability, stochastic models of the operations research, and engineering.
Journal ArticleDOI

Equilibrium balking strategies in the observable single-server queue with breakdowns and repairs

TL;DR: This work considers the Markovian single-server queue that alternates between on and off periods, and derives equilibrium threshold balking strategies in two cases, according to the information for the server's state.
Journal ArticleDOI

Single line queue with repeated demands

TL;DR: This paper analyzes a model of a queueing system in which customers can only call in to request service: if the server is free, the customer enters service immediately, but if the service system is occupied, the unsatisfied customer must break contact and reinitiate his request later.
Related Papers (5)