EOR
2002
13 years 4 months ago
2002
Precedence constraints are a part of a definition of any scheduling problem. After recalling, in precise graph-theoretical terms, the relations between task-on-arc and task-on-nod...
JIFS
2007
13 years 4 months ago
2007
We present a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids, and which works for au...
ORL
2008
13 years 4 months ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
CORR
2008
Springer
13 years 4 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
COR
2010
13 years 4 months ago
2010
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
AIPS
2009
13 years 5 months ago
2009
Recently, Helmert and Geffner proposed the context-enhanced additive heuristic, where fact costs are evaluated relative to context states that arise from achieving first a pivot c...
SODA
2001
ACM
13 years 5 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
CATA
2003
13 years 5 months ago
2003
In this paper we present a new method of combining multiple precedence constraints for a single task to support software systems having client-server relationships. In these types...
IPCO
2007
13 years 5 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...
FUN
2010
Springer
13 years 7 months ago
2010
Springer
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...