Detailed Analytical and Computational Studies of D-BMAP/D-BMSP/1 Queueing System

Sujit Kumar Samanta () and Kousik Das ()
Additional contact information
Sujit Kumar Samanta: National Institute of Technology Raipur
Kousik Das: National Institute of Technology Raipur

Methodology and Computing in Applied Probability, 2023, vol. 25, issue 1, 1-37

Abstract: Abstract This paper studies a discrete-time single server batch arrival and batch service queueing model with unlimited waiting space. The discrete-time batch Markovian arrival process and discrete-time batch Markovian service process, respectively, manage the arrival and service processes. We adopt the UL-type RG-factorization approach based on censoring methodology for variable size batch service queue to calculate the stationary probability vectors of the transition probability matrix with general structure Markov chain at outside observer’s epoch. We reblock the transition probability matrix to its desired M/G/1 structure to find the stationary probability vectors at outside observer’s epoch for fixed size batch service queue using the matrix analytic method. We also develop relationships to determine probability vector expressions for other important time epochs such as pre-arrival, intermediate, post-departure, and random epochs. The most challenging aspect of our study is to obtain the probability mass functions of sojourn time in the system for both the variable and fixed size batch service queues. We use our suggested queueing model to derive the results of several specific well-known queueing models. We also discuss about possible managerial implication of our model to produce fruit juices in manufacturing industry. We present computational experience based on the execution of parametrized experiments with various categories in order to validate the analytical results reported in this study.

Keywords: Discrete-time batch Markovian arrival process (D-BMAP); Discrete-time batch Markovian service process (D-BMSP); RG-factorization; Matrix analytic method; Queueing; Sojourn time; 60K25; 68M20; 90B22 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s11009-023-10012-7 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:metcap:v:25:y:2023:i:1:d:10.1007_s11009-023-10012-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/11009

DOI: 10.1007/s11009-023-10012-7

Access Statistics for this article

Methodology and Computing in Applied Probability is currently edited by Joseph Glaz

More articles in Methodology and Computing in Applied Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().