2004
DOI: 10.1016/j.orl.2003.09.006
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 29 publications
(15 citation statements)
references
References 9 publications
0
15
0
Order By: Relevance
“…In real systems, the maximum batch size or service capacity is often variable and stochastic, which has been studied in only a few papers. In many of these papers, the service capacity is generically distributed and does not depend on any parameter of the system, like the number of customers waiting in the queue, see the papers of Chaudhry and Chang 2004;Germs and Foreest 2010;Pradhan et al 2015;Sikdar and Samanta 2016. A more detailed description of these papers can be found in our paper (Baetens et al 2016).…”
Section: Introductionmentioning
confidence: 99%
“…In real systems, the maximum batch size or service capacity is often variable and stochastic, which has been studied in only a few papers. In many of these papers, the service capacity is generically distributed and does not depend on any parameter of the system, like the number of customers waiting in the queue, see the papers of Chaudhry and Chang 2004;Germs and Foreest 2010;Pradhan et al 2015;Sikdar and Samanta 2016. A more detailed description of these papers can be found in our paper (Baetens et al 2016).…”
Section: Introductionmentioning
confidence: 99%
“…However, in practice, the maximum batch size or capacity of the server can be variable and stochastic, a feature that has been incorporated in only a few papers. Chaudhry and Chang analysed the system content at various epochs in the Geo/G Y /1/N + B model in discrete time, where Y denotes the stochastic capacity of the server, which is upper-bounded by B, and N is the maximum queue capacity [6]. Furthermore, Pradhan et al obtained closed-form expressions for the queue length distribution at departure epochs for the discrete-time M/G Y r /1 queue where the service process depends on the batch size [7].…”
Section: Introductionmentioning
confidence: 99%
“…Taking Y = b, a constant, in particular, (2) and (3) reduce to (16) and (17) of Gupta and Goswami [5], respectively. Taking a = 1, on the other hand, they reduce to the results corresponding to (4)-(6) of Chaudhry and Chang [4]. Note that our results are much simpler than those of Chaudhry and Chang that are additionally involved with the distribution of a certain random variable.…”
Section: Relationship Between Random-epoch and Departure-epoch Distrimentioning
confidence: 48%
“…This batch-service rule is introduced by Powell and Humblet [8] and referred to as a versatile batch-service rule by Kim et al [7]. Recently, special cases of the Geo/G a,Y /1/K queue, namely, the Geo/G a,b /1/K and Geo/G Y /1/K queues were analyzed by Gupta and Goswami [5] and Chaudhry and Chang [4], respectively. Note that the Geo/G a,b /1/K queue has a constant service capacity, i.e., Y = b a constant, and the Geo/G Y /1/K queue has no particular threshold policy, i.e., a = 1.…”
Section: Introductionmentioning
confidence: 99%