Dynamic scheduling of a single‐server two‐class queue with constant retrial policy

We analyze the non‐preemptive assignment of a single server to two infinite‐capacity retrial queues. Customers arrive at both queues according to Poisson processes. They are served on first‐come‐first‐served basis following a cost‐optimal routing policy. The customer at the head of a queue generates a Poisson stream of repeated requests for service, that is, we have a constant retrial policy. All service times are exponential, with rates depending on the queues. The costs to be minimized consist of costs per unit time that a customer spends in the system. In case of a scheduling problem that arise when no new customers arrive an explicit condition for server allocation to the first or the second queue is given. The condition presented covers all possible parameter choices. For scheduling that also considers new arrivals, we present the conditions under which server assignment to either queue 1 or queue 2 is cost‐optimal.