Analysis and Cost Optimization of an N-policy Repairable Queue with Single Vacation and Variable Failure Rates
This paper develops an M/G/1 repairable queue with single vacation and variable failure rates under N-policy control,in which the server takes an uninterrupted vacation once the system becomes empty.When the server returns from vacation and finds that at least N customers are in the system,he/she immediately begins serving the waiting customers until the system becomes empty again.Otherwise,the server keeps idle but on duty until the number of customers waiting in the system reaches N and immediately begins serving the waiting customers.In addition,the service station has variable failure rates during its busy and idle periods.Such queueing model considers not only the random failures of the service station(service facility)that occur during its working periods but also the random failures of the service station that can also happen in its non-working periods due to environmental changes.Further,the random failures of the service station that occur during its non-working periods can be found only when the service station is activated.Hence,the idle failures of the service station can occur at most once in a busy cycle.The queueing model studied in this paper is more in line with the actual situation.Firstly,we apply the stochastic decomposition property of the steady-state queue size to derive its probability generating function of the system,and obtain some performance measures by some algebraic operations,such as the average queue size,the average length of the busy cycle and the average waiting time of an arbitrary customer.Secondly,we use the renewal process theory,the total probability decomposition technique and Laplace transform to discuss some critical reliability measures of the system,including the unavailability and failure frequency.Although setting the threshold N can reduce the cost of the system due to frequent startup,it also increases the customer's waiting time.Therefore,it is of great theoretical importance and application value to consider the cost optimization problem of the system under the expected waiting time constraints.Inspired by the above,we establish a cost model and a cost objective function to separately discuss the cost optimization problems with(without)the expected waiting time constraints under the widely-applied PH distribution.Several numerical examples are presented to determine the one-dimensional optimal threshold N*that minimizes the long-run expected cost of the system as well as the two-dimensional optimal threshold(N*,T*)when the vacation time is fixed as T,which provides ideas and theoretical support for the decision-makers to achieve the maximization of the economic benefits.Moreover,we compare the results of the unconstrained and constrained scenarios.The results show that the N*of starting the service without the expected waiting time constraints is larger than that of starting the service under the expected waiting time constraints,and the smaller the constraint threshold of waiting time is,the smaller the N*of starting the service is.The larger the corresponding minimum expected cost is.Thus,if the system manager expects to reduce customer's waiting time and increase customer satisfaction,it needs to start the system earlier and pay more costs.Such a consideration is from the manager's and customer's point of view to determine the optimal threshold,which is helpful for balancing the interests of the manager and customer,so as make the innovation of this paper clear.The theoretical analysis results have more practical application value.For future research,the continuous-time queueing system studied in this paper can be further extended to the corresponding discrete-time queueing system,and the non-Markovian arrival processes of customers and unin-terrupted multiple vacations can also be considered.
N-policysingle vacationvariable failure ratesperformance measuresoptimal control policy
万方数据
维普
