Controlling arrivals for a queueing system with an unreliable server: Newton-Quasi method

Abstract

This paper deals with the control policy of a removable and unreliable server for an M/M/1/K queueing system, where the removable server operates an F-policy. The so-called F-policy means that when the number of customers in the system reaches its capacity K (i.e. the system becomes full), the system will not accept any incoming customers until the queue length decreases to a certain threshold value F. At that time, the server initiates an exponential startup time with parameter c and starts allowing customers entering the system. It is assumed that the server breaks down according to a Poisson process and the repair time has an exponential distribution. A matrix analytical method is applied to derive the steady-state probabilities through which various system performance measures can be obtained. A cost model is constructed to determine the optimal values, say (F*, mu*, gamma*), that yield the minimum cost. Finally, we use the two methods, namely, the direct search method and the Newton-Quasi method to find the global minimum (F*, mu*, gamma*). Numerical results are also provided under optimal operating conditions. (C) 2009 Elsevier Inc. All rights reserved.