2018
DOI: 10.1007/s12351-018-0437-7
|View full text |Cite|
|
Sign up to set email alerts
|

Equilibrium and pricing analysis for an unreliable retrial queue with limited idle period and single vacation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
6
0

Year Published

2019
2019
2025
2025

Publication Types

Select...
9

Relationship

3
6

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 26 publications
0
6
0
Order By: Relevance
“…Yang et al [29] considered an unreliable retrial queue with J optional vacations, where the server is subject to random breakdowns and repairs when he is working. Gao et al [13] treated an M/M/1 retrial queue with an unreliable server from the economic viewpoint.…”
Section: Introductionmentioning
confidence: 99%
“…Yang et al [29] considered an unreliable retrial queue with J optional vacations, where the server is subject to random breakdowns and repairs when he is working. Gao et al [13] treated an M/M/1 retrial queue with an unreliable server from the economic viewpoint.…”
Section: Introductionmentioning
confidence: 99%
“…Bontali and Economou [1] considered equilibrium joining strategy for batch service queueing systems in unobservable and observable cases. Gao et al [6] dealt with an M/M/1 retrial queue with unreliable servers from an economic point of view. Do et al [2] studied M/M/1 retrial queues with working vacation and constant retrial rates and obtained customer equilibrium and socially optimal strategies for different information levels.…”
Section: Introductionmentioning
confidence: 99%
“…Later, Edelson and Hilderbrand [2] considered the case when the queue length is unobservable and showed that the optimal social toll is equal to the revenue-maximizing toll. Subsequently, many scholars published their works on the customer behaviour in various queueing systems, such as unreliable queueing systems [3,4], retrial queueing systems [5][6][7][8][9], queueing systems with catastrophe [10,11], vacation queueing systems [12][13][14][15][16][17], queueing system with egalitarian processor-sharing [18], queueing systems with priority customer [19,20], and service inventory systems [21][22][23][24]. And the following excellent monographs: Hassin and Haviv [25], Stidham [26], Hassin [27], summarized achievements in recent years.…”
Section: Introductionmentioning
confidence: 99%