Optimal routing into two heterogeneous service stations with delayed information

DOI10.1109/9.400488zbMath0832.90039OpenAlexW2171937741MaRDI QIDQ4850252

Damien Artiges

Publication date: 9 October 1995

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/9.400488

zbMATH Keywords

discrete-time Markov decision processescountable state spaceoptimal routing of messages

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Queues and service in operations research (90B22) Dynamic programming (90C39)

Related Items (4)

Discrete time queues with delayed information ⋮ Control of a random walk with noisy delayed information ⋮ Structural results on a batch acceptance problem for capacitated queues ⋮ Admission and routing control with partial information and limited buffers

This page was built for publication: Optimal routing into two heterogeneous service stations with delayed information