By Topic

Optimal routing into two heterogeneous service stations with delayed information

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
D. Artiges ; Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis

The problem of optimal routing of messages into two parallel queues is considered in the framework of discrete-time Markov decision processes with countable state space and unbounded costs. We assume that the controller has a delayed state information, the delay being equal to one time slot. Both discount and average optimal policies are shown to be monotone and of threshold type

Published in:

IEEE Transactions on Automatic Control  (Volume:40 ,  Issue: 7 )