Answers are grounded in this paper and cite their sources.
In this paper, we study a tandem queuing system in which the arrivals occur according to a versatile Markovian point process. The buffer sizes in the first and second nodes are, respectively, infinite and finite. We incorporate the impatience of the customers in both the nodes. The service times in both nodes are assumed to be of phase type. While the services in the first node are offered on a first-come-first-served basis, we assume that in the second node the services are provided in batches of varying sizes based on two pre-determined thresholds. The system is studied as a multi-dimensional continuous time Markov chain and a few illustrative numerical examples are reported.
No takes yet. Share an insight, caveat, or question.
Dudin et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: