This paper is concerned with the optimal control of a Markovian queueing system subjected to multiple adaptive vacation and working vacation policies. This system is applicable in diverse modern technologies, in particular in call centers. We establish the steady-state solution as well as important system characteristics by means of probability generating functions technique. We also construct the expected total cost for this model and develop a procedure to determine the optimal service rate that yields the minimum cost. Further, we carried out a comparative analysis to obtain the minimum cost using the Newton–Raphson method and particle swarm optimization (PSO) algorithm.
We study a queueing model with disasters, working breakdowns, balking, reneging, and vacations. This is a novel and realistic queueing model that captures the complex dynamics and behaviors of an automatic manufacturing system (AMS) with various uncertainties and disruptions. The system loses all customers when a disaster occurs and repairs start immediately. New customers get slower service during breakdowns. We use matrix methods to find the system’s steady state along with performance measures like the expected number of customers lost, the expected waiting time, and system reliability. We also optimize the system parameters (system capacity, number of servers, service rates) to minimize the cost function using a combined direct search method and quasi-Newton method. Our results can enhance the AMS’s performance, profit, and customer satisfaction.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.