28 search results - page 2 / 6 » Approximating Precedence-Constrained Single Machine Scheduli... |
IPCO
2007
13 years 6 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...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
STOC
1996
ACM
13 years 9 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
ACTA
1998
13 years 4 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
EUROPAR
2008
Springer
13 years 6 months ago
2008
Springer
We study the problem of scheduling independent tasks on a set of related processors which have a probability of failure governed by an exponential law. We are interested in the bi-...