2014
DOI: 10.1016/j.apm.2013.07.029
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of GI / M / n / n queueing system with ordered entry and no waiting line

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
2
0
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 32 publications
0
2
0
1
Order By: Relevance
“…Further extensions in parallel heterogeneous system studies can be found in Boxma et al (1994) [17], who gave a comprehensive view of solution methods for the epoch. Isguder and Uzunoglu (2014) [18] dealt with the semi-Markov process of GI/M/n/0 and loss quantification; more recently, Melikov et al (2020) [19] presented an exact formulation but with an approximate resolution for ordered entry. Specifically, for systems using the ordered entry process, one can also refer to the work of Cooper (1976) [20], who concluded the need for a multi-dimensional birth-and-death process to represent the system.…”
Section: Introductionmentioning
confidence: 99%
“…Further extensions in parallel heterogeneous system studies can be found in Boxma et al (1994) [17], who gave a comprehensive view of solution methods for the epoch. Isguder and Uzunoglu (2014) [18] dealt with the semi-Markov process of GI/M/n/0 and loss quantification; more recently, Melikov et al (2020) [19] presented an exact formulation but with an approximate resolution for ordered entry. Specifically, for systems using the ordered entry process, one can also refer to the work of Cooper (1976) [20], who concluded the need for a multi-dimensional birth-and-death process to represent the system.…”
Section: Introductionmentioning
confidence: 99%
“…Further extensions in parallel heterogeneous system studies can be found in Boxma et al (1994) [17], who gave a comprehensive view of solution methods at the epoch. Isguder and Uzunoglu (2014) [18] dealt with the semi-Markov process of GI/M/n/0 and loss quantification; and more recently Melikov et al (2020) [19] with an exact formulation, but approximate resolution for ordered entry. Specifically, systems under the ordered entry discipline can also be referred to the work of Cooper (1976) [20] that concludes the need for a multi-dimensional birth-and-death process to represent the system.…”
Section: Introductionmentioning
confidence: 99%
“…In [1], devoted to the study of QHS models, a Markovian infinite-queue system is studied, in which one of the free servers is assigned to service jobs of equal probability (this scheme is called randomized access). An analysis of the available literature has shown that the vast majority of studies investigate QHS models, which adopt randomized access schemes [1][2][3] and ordered access schemes [4][5][6][7][8]. An overview of these studies can be found in [9,10].…”
Section: Introductionmentioning
confidence: 99%