On feedback queueing system with reneging and retention of reneged customers, multiple working vacations and Bernoulli schedule vacation interruption
This paper presents an analysis of a Markovian feedback queueing system with reneging and retention of reneged customers, multiple working vacations and Bernoulli schedule vacation interruption, where customers’ impatience is due to the servers’ vacation. The reneging times are assumed to be exponen...
Gespeichert in:
Veröffentlicht in: | Arabian journal of mathematics 2017-03, Vol.6 (1), p.1-11 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper presents an analysis of a Markovian feedback queueing system with reneging and retention of reneged customers, multiple working vacations and Bernoulli schedule vacation interruption, where customers’ impatience is due to the servers’ vacation. The reneging times are assumed to be exponentially distributed. After the completion of service, each customer may reenter the system as a feedback customer for receiving another regular service with some probability or leave the system. A reneged customer can be retained in many cases by employing certain convincing mechanisms to stay in queue for completion of service. Thus, a reneged customer can be retained in the queueing system with some probability or he may leave the queue without receiving service. We establish the stationary analysis of the system. The probability generating functions of the stationary state probabilities is obtained, we deduce the explicit expressions of the system sizes when the server is in a normal service period and in a Bernoulli schedule vacation interruption, respectively. Various performance measures of the system are derived. Finally, we present some numerical examples to demonstrate how the various parameters of the model influence the behavior of the system. |
---|---|
ISSN: | 2193-5343 2193-5351 2193-5351 |
DOI: | 10.1007/s40065-016-0161-1 |