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

M. Vadivukarasi () and K. Kalidass ()
Additional contact information
M. Vadivukarasi: Karpagam Academy of Higher Education
K. Kalidass: Karpagam Academy of Higher Education

OPSEARCH, 2022, vol. 59, issue 4, No 6, 1352-1376

Abstract: Abstract 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.

Keywords: Disasters; Time dependent analysis; Steady state probabilities; Multiple variant vacations; Primary 90B22; Secondary 60K25 (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s12597-022-00574-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:59:y:2022:i:4:d:10.1007_s12597-022-00574-4

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-022-00574-4

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().