The achievable region approach seeks solutions to stochastic optimization problems by characterizing the space of all possible performances (the achievable region) of the system of interest and optimizing 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 queuing system. Powerful new methodologies due to the authors and co-workers are deployed to analyse a general multiclass queuing 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.
引用
收藏
页码:747 / 776
页数:30
相关论文
共 42 条
[41]
Whittle P., 1988, J APPL PROB A, V25A, P287, DOI DOI 10.2307/3214163