Abstract
We present diÆculties with realizing the capacity of queueing networks with batch servers under well known scheduling disciplines. We intro duce a family of scheduling p olicies called discrete-review p olicies, which not only guarantee capacity realization for queueing networks with batch servers, but also contain among them p olicies that allow us to realize desired b ehavior on \ uid" scale, including asymptotically optimal p olicies. In this family of p olicies system status is reviewed at discrete p oints in time, and at each such p oint the controller formulates a pro cessing plan for the next review p erio d, based on the queue length vector observed, which is then executed in op en-lo op fashion. We outline a pro of of capacity realization for every p olicy in this family, and provide results of simulation studies that establish the usefulness of the prop osed family of p olicies.