Optimal batch service of a polling system under partial information

We consider the optimal scheduling of an infinite-capacity batch server in a N -node ring queueing network, where the controller observes only the length of the queue at which the server is located. For a cost criterion that includes linear holding costs, fixed dispatching costs, and linear service rewards, we prove optimality and monotonicity of threshold scheduling policies.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45841/1/186_2005_Article_BF01193939.pd