Discussion on the transient solution of single server Markovian multiple variant vacation queues with disasters

This paper studies a single server Markovian queue with the possibility of catastrophes at the service station. In this model, the server takes a maximum number of J vacations till it finds at least one customer in the queue at a vacation completion instant. The time dependent probabilities of the s...

Full description

Saved in:
Bibliographic Details
Published inOpsearch Vol. 59; no. 4; pp. 1352 - 1376
Main Authors Vadivukarasi, M., Kalidass, K.
Format Journal Article
LanguageEnglish
Published New Delhi Springer India 01.12.2022
Springer Nature B.V
Subjects
Business and Management
Management
Mathematics
Operations research
Operations Research/Decision Theory
Queues
Service stations
Theoretical Article
Multiple variant vacations
Steady state probabilities
Disasters
Time dependent analysis
Secondary 60K25
Primary 90B22
Online AccessGet full text

Cover

More Information
Summary:This paper studies a single server Markovian queue with the possibility of catastrophes at the service station. In this model, the server takes a maximum number of J vacations till it finds at least one customer in the queue at a vacation completion instant. The time dependent probabilities of the system size are obtained. Four special cases are derived from the model presented in this study. Finally, some numerical computations are presented.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0030-3887
0975-0320
DOI:10.1007/s12597-022-00574-4