Optimal batch service of a polling system under partial information

We consider the optimal scheduling of an infinite-capacity batch server in aN-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.

[1]  D. Teneketzis,et al.  Time-average and asymptotically optimal flow control policies in networks with multiple transmitters , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[2]  Zvi Rosberg,et al.  Optimal control of service in tandem queues , 1982 .

[3]  R. Weber,et al.  Optimal control of service rates in networks of queues , 1987, Advances in Applied Probability.

[4]  R. Deb.  Optimal Dispatching of a Finite Capacity Shuttle. , 1978 .

[5]  S. H. Sim,et al.  Computational procedures for steady-state characteristics of unscheduled multi-carrier shuttle systems , 1983 .

[6]  Hyo-Seong Lee.  Control policies for queueing and production/inventory systems , 1988 .

[7]  Hideaki Takagi,et al.  Queueing analysis of polling models: progress in 1990-1994 , 1998 .

[8]  Demosthenis Teneketzis,et al.  Optimal flow control allocation policies in communication networks with multiple message classes , 1993 .

[9]  Demosthenis Teneketzis,et al.  Properties of optimal hop-by-hop allocation policies in networks with multiple transmitters and linear equal holding costs , 1991 .

[10]  Eitan Altman,et al.  Closed-loop control with delayed information , 1992, SIGMETRICS '92/PERFORMANCE '92.

[11]  Peter J. Kolesar,et al.  Optimal Dispatching of an Infinite-Capacity Shuttle: Control at a Single Terminal , 1974, Oper. Res..

[12]  Linn I. Sennott,et al.  Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs , 1989, Oper. Res..

[13]  Donald F. Towsley,et al.  On optimal polling policies , 1992, Queueing Syst. Theory Appl..

[14]  Peter J. Kolesar,et al.  Operating Characteristics of a Simple Shuttle under Local Dispatching Rules , 1972, Oper. Res..

[15]  Demosthenis Teneketzis,et al.  Optimal Scheduling of a Finite Capacity Shuttle under Delayed Information , 1992 .

[16]  D. Teneketzis,et al.  Routing in queueing networks under imperfect information: stochastic dominance and thresholds , 1989 .

[17]  Dimitri P. Bertsekas,et al.  Dynamic Programming: Deterministic and Stochastic Models , 1987 .

[18]  Moshe Sidi,et al.  Polling systems: applications, modeling, and optimization , 1990, IEEE Trans. Commun..

[19]  Shaler Stidham,et al.  Cost Models for Stochastic Clearing Systems , 1977, Oper. Res..

[20]  Pravin Varaiya,et al.  Stochastic Systems: Estimation, Identification, and Adaptive Control , 1986 .

[21]  I SennottLinn.  Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs , 1989 .

[22]  Anthony Barnett.  On operating a shuttle service , 1973, Networks.