In this paper we develop an N-server queueing model which overcomes some of the objections usually raised by business students when they are confronted with the discussion of queues in standard management science texts. The model permits a solution in terms of expected profit maximization rather...

This paper presents an algorithm for the solution of dynamic programming problems requiring the determination of optimal policies for the control of a special class of stochastic processes when the time horizon of the planning period is at infinity. These processes can be mathematically...