Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Asymptotic optimality of maximum pressure policies in stochastic
  processing networks   We consider a class of stochastic processing networks. Assume that the
networks satisfy a complete resource pooling condition. We prove that each
maximum pressure policy asymptotically minimizes the workload process in a
stochastic processing network in heavy traffic. We also show that, under each
quadratic holding cost structure, there is a maximum pressure policy that
asymptotically minimizes the holding cost. A key to the optimality proofs is to
prove a state space collapse result and a heavy traffic limit theorem for the
network processes under a maximum pressure policy. We extend a framework of
Bramson [Queueing Systems Theory Appl. 30 (1998) 89--148] and Williams
[Queueing Systems Theory Appl. 30 (1998b) 5--25] from the multiclass queueing
network setting to the stochastic processing network setting to prove the state
space collapse result and the heavy traffic limit theorem. The extension can be
adapted to other studies of stochastic processing networks.

23
The categories of this paper are: solv-int
3
The categories of this paper are: physics
15
The categories of this paper are: nucl-ex
6
The categories of this paper are: astro-ph
12
The categories of this paper are: nucl-th
29
The categories of this paper are: funct-an
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
1
The categories of this paper are: cs
35
The categories of this paper are: mtrl-th
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
9
The categories of this paper are: nlin
25
The categories of this paper are: patt-sol