The achievable region approach seeks solutions to stochastic optimisation
problems by: (i) characterising the space of all possible performances
(the achievable region) of the system of interest, and (ii) optimising
the overall system-wide performance objective over this space. This is
radically different from conventional formulations based on dynamic
programming. The approach is explained with reference to a simple
two-class queueing system. Powerful new methodologies due to the authors
and ...
The achievable region approach seeks solutions to stochastic optimisation
problems by: (i) characterising the space of all possible performances
(the achievable region) of the system of interest, and (ii) optimising
the overall system-wide performance objective over this space. This is
radically different from conventional formulations based on dynamic
programming. The approach is explained with reference to a simple
two-class queueing system. Powerful new methodologies due to the authors
and co-workers are deployed to analyse a general multiclass queueing
system with parallel servers and then to develop an approach to optimal
load distribution across a network of interconnected stations. Finally,
the approach is used for the first time to analyse a class of intensity
control problems.
+