Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Speed scaling with power down scheduling for agreeable deadlines   We consider the problem of scheduling on a single processor a given set of n
jobs. Each job j has a workload w_j and a release time r_j. The processor can
vary its speed and hibernate to reduce energy consumption. In a schedule
minimizing overall consumed energy, it might be that some jobs complete
arbitrarily far from their release time. So in order to guarantee some quality
of service, we would like to impose a deadline d_j=r_j+F for every job j, where
F is a guarantee on the *flow time*. We provide an O(n^3) algorithm for the
more general case of *agreeable deadlines*, where jobs have release times and
deadlines and can be ordered such that for every i<j, both r_i<=r_j and
d_i<=d_j.

13
The categories of this paper are: quant-ph
11
The categories of this paper are: hep-lat
0
The categories of this paper are: hep-ph
25
The categories of this paper are: patt-sol
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
7
The categories of this paper are: hep-th
9
The categories of this paper are: nlin
36
The categories of this paper are: cmp-lg
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con
31
The categories of this paper are: ao-sci
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn