28 search results - page 1 / 6 » Approximating Precedence-Constrained Single Machine Scheduli... |
APPROX
2006
Springer
13 years 8 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...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
IPCO
1998
13 years 5 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
ICALP
2011
Springer
12 years 8 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 ...
DAM
2007
13 years 4 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...