Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Streaming Approximation Scheme for Minimizing Total Completion Time on
  Parallel Machines Subject to Varying Processing Capacity   We study the problem of minimizing total completion time on parallel machines
subject to varying processing capacity. In this paper, we develop an
approximation scheme for the problem under the data stream model where the
input data is massive and cannot fit into memory and thus can only be scanned
for a few passes. Our algorithm can compute the approximate value of the
optimal total completion time in one pass and output the schedule with the
approximate value in two passes.

35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
8
The categories of this paper are: hep-ex
14
The categories of this paper are: math-ph
37
The categories of this paper are: supr-con
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
5
The categories of this paper are: gr-qc
0
The categories of this paper are: hep-ph
31
The categories of this paper are: ao-sci
23
The categories of this paper are: solv-int
3
The categories of this paper are: physics
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
12
The categories of this paper are: nucl-th