Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

Journal Article

The Complexity of Optimal Queuing Network Control

Christos H. Papadimitriou and John N. Tsitsiklis
Mathematics of Operations Research
Vol. 24, No. 2 (May, 1999), pp. 293-305
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3690486
Page Count: 13
Were these topics helpful?
See somethings inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Download ($30.00)
  • Add to My Lists
  • Cite this Item
The Complexity of Optimal Queuing Network Control
Preview not available

Abstract

We show that several well-known optimization problems related to the optimal control of queues are provably intractable-independently of any unproven conjecture such as P ≠ NP. In particular, we show that several versions of the problem of optimally controlling a simple network of queues with simple arrival and service distributions and multiple customer classes is complete for exponential time. This is perhaps the first such intractability result for a well-known optimization problem. We also show that the restless bandit problem (the generalization of the multi-armed bandit problem to the case in which the unselected processes are not quiescent) is complete for polynomial space.

Page Thumbnails

  • Thumbnail: Page 
293
    293
  • Thumbnail: Page 
294
    294
  • Thumbnail: Page 
295
    295
  • Thumbnail: Page 
296
    296
  • Thumbnail: Page 
297
    297
  • Thumbnail: Page 
298
    298
  • Thumbnail: Page 
299
    299
  • Thumbnail: Page 
300
    300
  • Thumbnail: Page 
301
    301
  • Thumbnail: Page 
302
    302
  • Thumbnail: Page 
303
    303
  • Thumbnail: Page 
304
    304
  • Thumbnail: Page 
305
    305