In an M/M/1 queueing model, a decision maker can choose m pairs of arrival- and service rates. He can change his action at any time epoch, a ‘switch’ of action costs an amount depending on the size of the switch. Besides that there are continuously incurring costs. Over a finite time horizon, there exists an optimal monotone hysteretic Markov policy. This is shown essentially by the technique of time discretization.
