On Bayesian index policies for sequential resource allocation

On Bayesian index policies for sequential resource allocation

Algebraic Deadlock Avoidance Policies for Sequential Resource Allocation Systems ∗

As many contemporary technological applications move to operational modes of more extensive and flexible automation, there is a rising need to design and control the underlying resource allocation not only for efficiency, but also for logical correctness and internal consistency. The material presented in this chapter offers a unifying and comprehensive treatment of a class of policies that hav...

Polynomial-Complexity Deadlock Avoidance Policies for Sequential Resource Allocation Systems

The development of e cient deadlock avoidance policies (DAP's) for sequential resource allocation systems (RAS) is a problem of increasing interest in the scienti c community, largely because of its relevance to the design of large-scale exibly automated manufacturing systems. Much of the work on this problem existing in the literature, is focused on the so called Single-Unit RAS model, which i...

Polynomial-Complexity Deadlock Avoidance Policies for Sequential Resource Allocation Systems - Automatic Control, IEEE Transactions on

The development of efficient deadlock avoidance policies (DAP’s) for sequential resource allocation systems (RAS’s) is a problem of increasing interest in the scientific community, largely because of its relevance to the design of large-scale flexibly automated manufacturing systems. Much of the work on this problem existing in the literature is focused on the so-called single-unit RAS model, w...

Optimal Adaptive Policies for Sequential Allocation Problems

p Ž . 0 Ž . Ž . Ž . V u under any policy p in C is equal to nm* u y M u log n q o log n , as n R Ž . Ž . Ž . n a `, where m* u is the largest population mean and M u is a constant. ii Policies in C are asymptotically optimal within a larger class C of ‘‘uniformly R UF 0 p Ž Ž . Ž .. fast convergent’’ policies in the sense that limna ` nm* u y V u r n Ž Ž . pŽ .. Ž . nm* u y V u F 1, for any p g...