Abstract
We consider a finite-source queueing system with two distinct customer classes. The problem is to obtain a nonpreemptive service assignment policy which maximizes the expected discounted value of rewards received over an infinite planning horizon. In all policies, there are particular policies which simply enforce priority rankings. We call these static policies. When the expected "thinking times" of all customers are the same, it is shown that there is an optimal static policy.
