Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A repairable GeoX/G/1 retrial queue with Bernoulli feedback and impatient customers
by
Gao, Shan
, Liu, Zai-ming
in
Customer services
/ Customers
/ Discrete time systems
/ Markov analysis
/ Markov chains
/ Queuing theory
/ Steady state
2014
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
A repairable GeoX/G/1 retrial queue with Bernoulli feedback and impatient customers
by
Gao, Shan
, Liu, Zai-ming
in
Customer services
/ Customers
/ Discrete time systems
/ Markov analysis
/ Markov chains
/ Queuing theory
/ Steady state
2014
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
A repairable GeoX/G/1 retrial queue with Bernoulli feedback and impatient customers
Journal Article
A repairable GeoX/G/1 retrial queue with Bernoulli feedback and impatient customers
2014
Request Book From Autostore
and Choose the Collection Method
Overview
This paper deals with a discrete-time batch arrival retrial queue with the server subject to starting failures. Different from standard batch arrival retrial queues with starting failures, we assume that each customer after service either immediately returns to the orbit for another service with probability θ or leaves the system forever with probability 1 − θ (0 ≤ θ < 1). On the other hand, if the server is started unsuccessfully by a customer (external or repeated), the server is sent to repair immediately and the customer either joins the orbit with probability q or leaves the system forever with probability 1 − q (0 ≤ q < 1). Firstly, we introduce an embedded Markov chain and obtain the necessary and sufficient condition for ergodicity of this embedded Markov chain. Secondly, we derive the steady-state joint distribution of the server state and the number of customers in the system/orbit at arbitrary time. We also derive a stochastic decomposition law. In the special case of individual arrivals, we develop recursive formulae for calculating the steady-state distribution of the orbit size. Besides, we investigate the relation between our discrete-time system and its continuous counterpart. Finally, some numerical examples show the influence of the parameters on the mean orbit size.
Publisher
Springer Nature B.V
Subject
This website uses cookies to ensure you get the best experience on our website.