On computing average cost optimal policies with application to routing to parallel queues

On computing average cost optimal policies with application to routing to parallel queues

0.00 Avg rating0 Votes
Article ID: iaor19972497
Country: Germany
Volume: 45
Issue: 1
Start Page Number: 45
End Page Number: 62
Publication Date: Jan 1997
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors:
Keywords: parallel queues
Abstract:

The Approximating Sequence Method for computation of average cost optimal stationary policies in denumerable state Markov decision chains, introduced by Sennot is reviewed. New methods for verifying the assumptions are given. These are useful for models with multi-dimensional state spaces that satisfy certain mild structural properties. The results are applied to four problems in the optimal routing of packets to parallel queues. Numerical results are given for one of the models.

Reviews

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