A class of asymptotically optimal group screening strategies with limited item participation

Cheng, Yongxi; Yang, Yunyue; Du, Ding‐Zhu

doi:10.1016/j.dam.2019.06.012

Cited by 2 publications

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the test shows up a positive result then everyone involved in that group needs to be tested either individually or in subgroups. In the latter case, the strategy of subgroup selection is to be optimized (Cheng et al 2019). The idea of pooling in queues originally appeared in Neuts and Chandramouli (1987), and very recently this model was put in use by a team from the Institute of Virology (Lohse et al 2020).…”

Section: Introductionmentioning

confidence: 99%

Analysis of a Queueing Model with Batch Markovian Arrival Process and General Distribution for Group Clearance

Chakravarthy

Shruti

Rumyantsev

2020

Methodol Comput Appl Probab

View full text Add to dashboard Cite

In this paper we consider a single server queueing model with under general bulk service rule with infinite upper bound on the batch size which we call group clearance. The arrivals occur according to a batch Markovian point process and the services are generally distributed. The customers arriving after the service initiation cannot enter the ongoing service. The service time is independent on the batch size. First, we employ the classical embedded Markov renewal process approach to study the model. Secondly, under the assumption that the services are of phase type, we study the model as a continuous-time Markov chain whose generator has a very special structure. Using matrix-analytic methods we study the model in steady-state and discuss some special cases of the model as well as representative numerical examples covering a wide range of service time distributions such as constant, uniform, Weibull, and phase type.

show abstract

Section: Introductionmentioning

confidence: 99%