Optimal batch service of a polling system under partial information

Optimal batch service of a polling system under partial information

0.00 Avg rating—0 Votes
Article ID: iaor19972559
Country: Germany
Volume: 44
Issue: 3
Start Page Number: 401
End Page Number: 419
Publication Date: Nov 1996
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Keywords: batch queues
Abstract:

The authors consider the optimal scheduling of an infinite-capacity batch server in a N-mode 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, they prove optimality and monotonicity of threshold scheduling policies.

Reviews

Required fields are marked *. Your email address will not be published.