DOI 10.1007/s11134-006-9006-5 Optimal server scheduling in nonpreemptive finite-population queueing systems

Abstract We consider a finite-population queueing system with heterogeneous classes of customers and a single server. For the case of nonpreemptive service, we fully characterize the structure of the server’s optimal service policy that mini-mizes the total average customer waiting costs. We show that the optimal service policy may never serve some classes of customers. For those classes that are served, we show that the optimal service policy is a simple static priority policy. We also derive sufficient conditions that determine the optimal priority sequence