Predictive design of the f-policy markovian queue

We consider in this paper the M/M/1/K queueing model under the F policy. In this system, customers are denied entry when the system is full, until the queue size drops to the level F, following the departure of served customers. To start the admission of customers again, a startup job is required for the server. Since the goal of the F-policy is to gain control over the system, we propose an approach that selects the optimal system parameters. Numerical examples validate the theoretical results obtained.