Issue |
RAIRO-Oper. Res.
Volume 51, Number 1, January-March 2017
|
|
---|---|---|
Page(s) | 79 - 100 | |
DOI | https://doi.org/10.1051/ro/2016005 | |
Published online | 15 December 2016 |
Analysis of a GI/M/1 queue in a multi-phase service environment with disasters
1 School of Science, Nanjing University of Science and Technology, Nanjing
210094, P.R. China.
jtao0728@163.com
Received:
11
April
2015
Accepted:
21
January
2016
In this paper, we study a single server GI/M/1 queue in a multi-phase service environment with disasters, where the disasters occur only when the server is busy serving customers. Whenever a disaster occurs in an operative service phase, all present customers are forced to leave the system simultaneously, the server abandons the service and an exponential repair time is set on. After the system is repaired, the server resumes his service and moves to service phase i immediately with probability qi,i = 1,2,...,N. Using the matrix analytic approach and semi-Markov process, we obtain the stationary queue length distribution at both arrival and arbitrary epochs. After introducing tagged customers and the concept of a cycle, we also derive the sojourn time distribution, the duration of a cycle, and the length of the server’s working time in a service cycle. In addition, numerical examples are presented to illustrate the impact of some critical model parameters on performance measures.
Mathematics Subject Classification: 68M20 / 60K20 / 90B22
Key words: GI/M/1 queue / matrix analytic approach / multi-phase service environment / disasters / cycle analysis
© EDP Sciences, ROADEF, SMAI 2016
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.