2015
DOI: 10.1016/j.jmaa.2015.05.028
|View full text |Cite
|
Sign up to set email alerts
|

Analysis of the M/G/1 queue in multi-phase random environment with disasters

Abstract: This paper studies an M/G/1 queue in a multi-phase random environment. When in operative phase i, i = 1, 2, . . . , n, the system is subject to disastrous interruptions, causing all present customers (waiting and served) to leave the system. At an exponential failure instant, the server abandons the service and the system goes directly to repair phase. After an exponential repair time, the system moves to operative phase i with probability q i , i = 1, 2, . . . , n. Using the supplementary variable technique, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6
2

Relationship

2
6

Authors

Journals

citations
Cited by 40 publications
(25 citation statements)
references
References 26 publications
(29 reference statements)
0
24
0
Order By: Relevance
“…. , , then {( ℓ , ℓ ), ℓ ≥ 1} is positive recurrent; thus we have (21) and (22). For ≥ 2, using equation (1.5.4) of Neuts [24], we obtain…”
Section: Stationary Distribution At Arrival Epochsmentioning
confidence: 95%
See 1 more Smart Citation
“…. , , then {( ℓ , ℓ ), ℓ ≥ 1} is positive recurrent; thus we have (21) and (22). For ≥ 2, using equation (1.5.4) of Neuts [24], we obtain…”
Section: Stationary Distribution At Arrival Epochsmentioning
confidence: 95%
“…In their 2 Mathematical Problems in Engineering model, the system moves from repair phase to some service environment with a certain probability after being repaired. Jiang et al [22,23] extended Paz and Yechiali's work to an / /1 and / /1 queue. In [15], Li and Liu studied a discrete-time / /1 queue with vacations in random environment in which the system jumps from vacation phase to a service phase with a certain probability when vacation phase ends.…”
Section: Introductionmentioning
confidence: 96%
“…Haviv and Oz [9] reviewed some existing observable queueing mechanisms where money transfers was taken into account concluding that the best ones are those in which customers have to make up their mind to join the queue without inspecting the queue length. Jiang et al [10] dealt with a disaster queue in a multi-phase random environment in which the system stops working suddenly and resumes after exponential repair time. Kumar et al [11] derived an optimization model of an feedback queue with retention of reneged customers.…”
Section: Brief Literature Reviewmentioning
confidence: 99%
“…Lemma 2 (see Lemma 2 in [12]) Let X, Y, Z be the random variables, and Z = min (X, Y ), where X follows a general (arbitrary) distribution with mean 1 µ and distribution function X(ν) and Laplace Stieltjes transform X * (s), Y follows an exponential distribution with parameter η, then we have…”
Section: Performance Measuresmentioning
confidence: 99%
“…In this paper, we give the stationary queue size distribution at an arbitrary epoch. Following the idea presented by Jiang et al [12] , which provided an approach to analyze the sojourn time distribution and the length of the server's working time in a cycle, we also derive these performance measures in our paper. The rest of this paper is organized as follows: Section 2 is the model description.…”
mentioning
confidence: 99%