A c-mu Rule for Two-Tiered Parallel Servers

The cμ rule is known to be optimal in many queueing systems with memoryless service and inter-arrival times. We establish a cμ rule for a parallel flexible server system with two tiers. Multiple job classes arrive and wait in separate queues. The first tier contains classes that can only be served by one server each, and the second tier contains a class that can be served by all servers. The cμ preferences give priority to the first tier. Sequencing decisions are made to minimize linear holding costs.