Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the
  Average Flow Time   We study the problem of preemptive scheduling of n equal-length jobs with
given release times on m identical parallel machines. The objective is to
minimize the average flow time. Recently, Brucker and Kravchenko proved that
the optimal schedule can be computed in polynomial time by solving a linear
program with O(n^3) variables and constraints, followed by some substantial
post-processing (where n is the number of jobs.) In this note we describe a
simple linear program with only O(mn) variables and constraints. Our linear
program produces directly the optimal schedule and does not require any
post-processing.

35
The categories of this paper are: mtrl-th
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
13
The categories of this paper are: quant-ph
15
The categories of this paper are: nucl-ex
16
The categories of this paper are: stat
22
The categories of this paper are: chao-dyn
24
The categories of this paper are: dg-ga
29
The categories of this paper are: funct-an
17
The categories of this paper are: q-fin
20
The categories of this paper are: acc-phys
18
The categories of this paper are: econ
14
The categories of this paper are: math-ph
0
The categories of this paper are: hep-ph
2
The categories of this paper are: math