Article ID: | iaor20173830 |
Volume: | 51 |
Issue: | 1 |
Start Page Number: | 101 |
End Page Number: | 122 |
Publication Date: | Jan 2017 |
Journal: | RAIRO - Operations Research |
Authors: | Tang Yinghui, Lan Shaojun |
Keywords: | queues: applications, service, stochastic processes, simulation, optimization |
This paper is concerned with a discrete‐time [Formula: see text] queueing system with [Formula: see text]‐policy and [Formula: see text]‐optional services in which the service station may be subject to failures at random during serving the customers. All the arriving customers require the first essential service, whereas some of them may opt for a second service from the [Formula: see text] additional services with some probability. As soon as the system becomes empty, the server will not restart the service until the sum of the service times of the waiting customers in the system reaches or exceeds some given positive integer [Formula: see text]. Applying the total probability decomposition law, renewal theory, and probability generating function technique, the queueing indices and reliability measures are investigated simultaneously in our work. Both the probability generating function of the transient queue length distribution and the explicit formulas of the steady‐state queue length distribution at time epoch [Formula: see text] are derived. Meanwhile, the stochastic decomposition property is presented for the proposed model. Various reliability indices, including the transient and steady‐state unavailability, the expected number of breakdowns during [Formula: see text], and the equilibrium failure frequency, are discussed. Finally, the optimum value of [Formula: see text] for minimizing the system cost is numerically discussed under a given cost structure.