Analysis of a bulk arrival N-policy queue with two-service genre, breakdown, delayed repair under Bernoulli vacation and repeated service policy

Abstract

This article deals with an unreliable bulk arrival single server queue rendering two-heterogeneous optional repeated service (THORS) with delayed repair, under Bernoulli Vacation Schedule (BVS) and N-policy. For this model, the joint distribution of the server’s state and queue length are derived under both elapsed and remaining times. Further, probability generating function (PGF) of the queue size distribution along with the mean system size of the model are determined for any arbitrary time point and service completion epoch, besides various pivotal system characteristics. A suitable linear cost structure of the underlying model is developed, and with the help of a difference operator, a locally optimal N-policy at a lower cost is obtained. Finally, numerical experiments have been carried out in support of the theory.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 9 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.