Dynamic Allocation of Entities in Closed Queueing Networks: An Application to Debris Removal

被引：0

作者：

Brooks, James D. ^{[1
]}

Kar, Koushik ^{[1
]}

Mendonca, David ^{[1
]}

机构：

[1] Rensselaer Polytech Inst, Troy, NY 12180 USA

来源：

2013 IEEE INTERNATIONAL CONFERENCE ON TECHNOLOGIES FOR HOMELAND SECURITY (HST) | 2013年

关键词：

CONVEXITY; QUEUES;

D O I：

暂无

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This work describes a novel method for allocating entities to routes in a closed queueing network to maximize system throughput. Results are presented which compare this method with known prior work and known optimal solutions to provide an empirical optimality gap. Further, because the system of interest, debris removal following natural disasters, is under the control of rational agents, optimality conditions are derived in order to determine to efficacy of a flat market context in inducing optimal behavior.

引用

页码：504 / 510

页数：7