Dynamic scheduling of a system with two parallel servers in heavy traffic with resource pooling: Asymptotic optimality of a threshold policy (Q1872431): Difference between revisions

The authors consider a queueing system consisting of two buffers and two parallel servers with dynamic scheduling capabilities. One server can process jobs from one buffer, whereas the other server can process jobs from either buffer. The service time distribution may depend on the buffer being served and the server providing service. The system manager dynamically schedules waiting jobs onto available servers. The authors consider a parameter regime in which the system satisfies both a heavy traffic condition and a resource pooling condition. The cost function is a mean cumulative discounted cost of holding jobs in the system. They propose a dynamic threshold control policy and show that it is the same as the optimal cost for the Brownian control problem.