4 search results - page 1 / 1 » Single Machine Precedence Constrained Scheduling Is a Vertex... |
ESA
2006
Springer
14 years 9 months ago
2006
Springer
APPROX
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
ICALP
2011
Springer
13 years 9 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
IPCO
2007
14 years 7 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...