2006
DOI: 10.1007/978-0-387-33723-4
|View full text |Cite
|
Sign up to set email alerts
|

Vacation Queueing Models Theory and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

2
207
1
3

Year Published

2009
2009
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 500 publications
(213 citation statements)
references
References 0 publications
2
207
1
3
Order By: Relevance
“…The study of reneging within the class of queueing systems with vacations is a new endeavor. Although, there exists a significant number of papers and books on vacation queueing systems (see, e.g., Takagi (1991) and Tian and Zhang (2006)), the reneging feature has not yet received much attention. Only recently, Altman and Yechiali (2006) and Yechiali (2007) considered systems with vacations, where the source of the impatience is the absence of the server.…”
Section: Introductionmentioning
confidence: 99%
“…The study of reneging within the class of queueing systems with vacations is a new endeavor. Although, there exists a significant number of papers and books on vacation queueing systems (see, e.g., Takagi (1991) and Tian and Zhang (2006)), the reneging feature has not yet received much attention. Only recently, Altman and Yechiali (2006) and Yechiali (2007) considered systems with vacations, where the source of the impatience is the absence of the server.…”
Section: Introductionmentioning
confidence: 99%
“…The time expires at time 2 t and the server initiates a busy period at that time with only one customer. During this busy period, customers 5 C and 6 C arrive and are served before the server commences another vacation. While the server is on vacation, customer 7 C arrives and activates the time.…”
Section: Nl Lmentioning
confidence: 99%
“…Several excellent surveys on these vacation models have been done by Doshi [2] [3], and the books by Takagi [4] and Tian and Zhang [5] are devoted to the subject. One of the most remarkable results for vacation queueing systems is the stochastic decomposition result, which is introduced by Fuhrmann and Cooper [6] and allows the system's behavior to be analyzed by considering separately the distribution of system (queue) size with no vacation and additional system size due to vacation.…”
Section: Introductionmentioning
confidence: 99%
“…Vacation is slightly different from failure. While the latter is accidental, the former is scheduled and conscientiously undertaken [15]. It is a process governed by a policy that explicitly specifies: a. Staring rules: exhaustive when beginning vacation only if queue (system) is empty, otherwise it is non-exhaustive and can begin at any time.…”
Section: Service Typesmentioning
confidence: 99%