Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  reneging
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The paper presents stochastic modelling of a single server, finite buffer Markovian queueing system with discouraged arrivals, baulking, reneging, and retention of reneged customers. The Markov process is used to derive the steady-state solution of the model. Closed-form expressions using probability generating functions (PGFs) are derived and presented for both classical and novel performance measures. In addition, a sensitivity analysis is carried out to study the effect of the system parameters on performance measures. A numerical problem is also presented to demonstrate the derived results and some design aspects.
EN
This paper deals with customers’ impatience behaviour for single server Markovian queueing system under K-variant working vacation policy, waiting server, Bernoulli feedback, balking, reneging, and retention of reneged customers. Using the probability generating function (PGF) technique, we obtain the steady-state solution of the system. Besides, we prove the stochastic decomposition properties. Useful performance measures of the considered queueing system are derived. A cost model is developed. Then, the parameter optimisation is carried out numerically, using a quadratic fit search method (QFSM). Finally, numerical examples are provided to visualise the analytical results.
EN
Customer impatience has become a threat to the business world. Firms employ various customer retention strategies to retain their impatient (or reneged) customers. Customer retention mechanisms may help to retain some or all impatient customers. Further, due to unsatisfactory service, customers may rejoin a queue immediately after departure. Such cases are referred to as feedback customers. Kumar and Sharma take this situation into account and study an M/M/1/N feedback queuing system with retention of reneged customers. They obtain only a steady-state solution for this model. In this paper, we extend the work of Kumar and Sharma by performing an economic analysis of the model. We develop a model for the costs incurred and perform the appropriate optimization. The optimum system capacity and optimum service rate are obtained.
4
Content available remote Stability of two families of real-time queueing networks
EN
We study open multiclass queueing networks with renewal arrival streams and general service time distributions. Upon arrival to the network, customers from each class are assigned a random deadline drawn from a distribution associated with this class.We show that preemptive subcritical EDF networks with fixed customer routes are stable. We also prove that a broad class of (not necessarily subcritical) networks with reneging and Markovian routing, including EDF, FIFO, LIFO, SRPT, fixed priorities and processor sharing, is stable.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.