Title :
Optimal routing into two heterogeneous service stations with delayed information
Author_Institution :
Inst. Nat. de Recherche en Inf. et Autom., Sophia Antipolis
fDate :
7/1/1995 12:00:00 AM
Abstract :
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
Keywords :
Markov processes; delays; optimisation; queueing theory; average optimal policies; countable state space; delayed information; discount; discrete-time Markov decision processes; heterogeneous service stations; optimal message routing; parallel queues; unbounded costs; Cost function; Delay effects; Dynamic programming; Infinite horizon; Optimal control; Propagation delay; Random variables; Routing; State feedback; State-space methods;
Journal_Title :
Automatic Control, IEEE Transactions on