The complexity of optimal queueing network control

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory Pub Date : 1994-06-28 DOI:10.1109/SCT.1994.315792

C. Papadimitriou, J. Tsitsiklis

引用次数: 284

Abstract

We consider the classical problem of optimal control (routing and sequencing) of a network of queues. We prove that this problem is EXP-complete and, therefore, provably intractable. Similar results are established for restricted versions of the problem. A weaker result is also established for the restless bandit problem.<>

查看原文本刊更多论文

最优排队网络控制的复杂性

我们考虑一个队列网络的最优控制(路由和排序)的经典问题。我们证明这个问题是exp完全的，因此，可以证明是难以解决的。对于问题的限制版本，也建立了类似的结果。对于不安分的土匪问题，也建立了一个较弱的结果

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory

自引率

0.00%

发文量