93 search results - page 15 / 19 » Non-clairvoyant scheduling with precedence constraints |
RTSS
1999
IEEE
15 years 2 months ago
1999
IEEE
In this paper we present a framework integrating speci cation and scheduler generation for real-time systems. In a rst step, the system, which can include arbitrarily designed tas...
ALGORITHMICA
2002
14 years 9 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
CP
2004
Springer
15 years 3 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...
CLOUDCOM
2009
Springer
15 years 1 months ago
2009
Springer
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
CP
2004
Springer
15 years 1 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...