1986
DOI: 10.1007/bf01149327
|View full text |Cite
|
Sign up to set email alerts
|

Queueing systems with vacations ? A survey

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
429
1
5

Year Published

1988
1988
2016
2016

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 1,067 publications
(436 citation statements)
references
References 30 publications
1
429
1
5
Order By: Relevance
“…Adding q (1) 1π to both sides, using that 1π − Q 2 is non-singular and π 1π − Q 2 −1 = π we obtain (66).…”
Section: Mean Fluid Levelmentioning
confidence: 99%
See 3 more Smart Citations
“…Adding q (1) 1π to both sides, using that 1π − Q 2 is non-singular and π 1π − Q 2 −1 = π we obtain (66).…”
Section: Mean Fluid Levelmentioning
confidence: 99%
“…Making use of the block-partitioned structure of Q (see (1)) and the relation between Q andQ given by (6) we get…”
Section: Important Relationsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, it is not imbedded to some known class of vacation queueing models. Vacation models are usually classified (see, e.g., Doshi, 1986;Takagi, 1991;Tian and Zhang, 2006), by the discipline of switching the server off (exhaustive, gated, limited, etc. ) and switching it on (N -, T -, E-strategies, etc.).…”
mentioning
confidence: 99%