analysis and optimal control of a discrete-time queueing system under the (m,n)-policy
This paper analyzes a discrete-time single-server queue under bilevel threshold control and early setup. The joint generating function of the server state and the number of customers in the system together with the main performance measures are derived. We also study the length of the different busy periods of the server as well as the number of customers served during a busy period. We establish a cost model and find the optimal solution using a tabu search algorithm due the difficulty to prove the convexity of the cost function. Finally, we show some numerical examples to see the influence of the setup time distribution and the sensibility of the different costs.
optimal control discrete-time queue early setup tabu search