Optimal server time sharing between request queues

The problem of optimizing a sequence and durations of services conflicting queues of customers in a queueing system described by a controlled Markov chain is considered. An iterative method of dynamic programming which excludes from consideration the obviously nonoptimal controlling actions is utilized for the solution. As an example, optimal durations of stages of a traffic light controlling traffic at an isolated intersection are determined.