2013
DOI: 10.1155/2013/182497
|View full text |Cite
|
Sign up to set email alerts
|

The Geo/Geo/1+1 Queueing System with Negative Customers

Abstract: We study a Geo/Geo/1+1 queueing system with geometrical arrivals of both positive and negative customers in which killing strategies considered are removal of customers at the head (RCH) and removal of customers at the end (RCE). Using quasi-birthdeath (QBD) process and matrix-geometric solution method, we obtain the stationary distribution of the queue length, the average waiting time of a new arrival customer, and the probabilities of servers in busy or idle period, respectively. Finally, we analyze the effe… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…Furthermore, if customers' joining rate is the maximum probability , it is obvious that all customers enter the queue despite of different charging systems. From (8) and (15), we know the expected profits in EPP and EAP scheme models are the same.…”
Section: Analysis and Numerical Experimentsmentioning
confidence: 99%
See 1 more Smart Citation
“…Furthermore, if customers' joining rate is the maximum probability , it is obvious that all customers enter the queue despite of different charging systems. From (8) and (15), we know the expected profits in EPP and EAP scheme models are the same.…”
Section: Analysis and Numerical Experimentsmentioning
confidence: 99%
“…Takagi [4] focused on the performance evaluation in discrete-time systems. Subsequently, more discrete-time queueing system studies have been conducted such as [5][6][7][8].…”
Section: Introductionmentioning
confidence: 99%
“…For related work on discrete-time G-queues with negative customers, the reader is referred to [3,7,14,[16][17][18][19][20][21][22][23]. For work on continuous-time queueing models with negative customers and/or disasters, we refer to the bibliography in [24,25] and the more recent papers [26][27][28][29][30][31][32][33][34][35][36].…”
Section: Introductionmentioning
confidence: 99%