Analysis of an unreliable N – policy queue with set-up period under Bernoulli schedule and re-service approach

Abstract

This research article investigates the stationary N-policy with a set-up time of a single server bulk arrival queueing model rendering two-heterogeneous optional repeated service (THORS) with the factor of unreliability. The server studied here is allowed to take a single vacation after each busy period following Bernoulli Schedule (BS). An extensive analysis of the proposed model is carried out using the Supplementary Variable Technique (SVT) under some suitable transformations. The joint distribution of the server’s state and queue length are obtained under both elapsed and remaining times along with their double transforms. Probability generating function (PGF) of the queue size distribution together with the mean system size of the model are determined for any arbitrary time point and service completion epoch, besides the busy period distribution and 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, some numerical experiments are carried out in support of the theory.