Add to ORKGIn this talk we consider queueing systems which are subject to control (e.g. admission control, routing control) by an external decision-maker. These systems can be modelled using Markov Decision Processes (MDPs), and our aim is to determine an optimal "policy" which specifies the most advantageous decisions to be taken. We discuss how the techniques of stochastic dynamic programming can be used to compute optimal policies, and how the "adaptive" methods of reinforcement learning can be used to find near-optimal solutions when the dimensionality of the problem becomes too large
This paper studies a class of queueing control problems involving commonly used control mechanisms s...
With the rapid advance of information technology, network systems have become increasingly complex a...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.In this thesis we consider th...
Methods for optimising measures of social utility in queueing systems usually require interventions ...
We review models for the optimal control of networks of queues, Our main emphasis on models based on...
This thesis discusses queueing systems in which decisions are made when customers arrive, either by ...
We consider a Markovian queueing system with N heterogeneous service facilities, each of which has m...
The first part considers discrete-time constrained Markov Decision Processes (MDPs). At each epoch, ...
Semi-Markov Decision Problems are continuous time generalizations of discrete time Markov Decision P...
We consider a GI/M/s queuing system that is controlled by either accepting or rejecting arriving cus...
International audienceWe consider a class of Markov Decision Processes frequently employed to model ...
Queueing Theory has been successfully and extensively applied to the scheduling, control, and analys...
The (optimal) design of many engineering systems can be adequately recast as a Markov decision proce...
A queueing system can be represented as a stochastic process, in which events (e.g. arrivals, servic...
We consider the optimal control problem of emptying a deterministic single server multiclass queuing...
This paper studies a class of queueing control problems involving commonly used control mechanisms s...
With the rapid advance of information technology, network systems have become increasingly complex a...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.In this thesis we consider th...
Methods for optimising measures of social utility in queueing systems usually require interventions ...
We review models for the optimal control of networks of queues, Our main emphasis on models based on...
This thesis discusses queueing systems in which decisions are made when customers arrive, either by ...
We consider a Markovian queueing system with N heterogeneous service facilities, each of which has m...
The first part considers discrete-time constrained Markov Decision Processes (MDPs). At each epoch, ...
Semi-Markov Decision Problems are continuous time generalizations of discrete time Markov Decision P...
We consider a GI/M/s queuing system that is controlled by either accepting or rejecting arriving cus...
International audienceWe consider a class of Markov Decision Processes frequently employed to model ...
Queueing Theory has been successfully and extensively applied to the scheduling, control, and analys...
The (optimal) design of many engineering systems can be adequately recast as a Markov decision proce...
A queueing system can be represented as a stochastic process, in which events (e.g. arrivals, servic...
We consider the optimal control problem of emptying a deterministic single server multiclass queuing...
This paper studies a class of queueing control problems involving commonly used control mechanisms s...
With the rapid advance of information technology, network systems have become increasingly complex a...
100 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.In this thesis we consider th...