Before revision:   We also consider the bidirectional problem where there are no directional restrictions on resource allocation and give an optimal policy that has lower expected time complexity than known algorithms in literature in resource rich regimes .
After revision:  As we consider a case where different resources can satisfy different numbers of users, we also generate new results for bulk service queues. We also consider the bidirectional problem where there are no directional restrictions on resource allocation and give an optimal policy that has lower expected time complexity than known algorithms in literature in resource rich regimes .