Abstract
In this paper we construct an algorithm of successive approximation type that computes a locally optimal periodic policy for a Markov decision chain with partial state information. The algorithm is applied to a queueing network with server control.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have