93 search results - page 5 / 19 » Non-clairvoyant scheduling with precedence constraints |
PARCO
2007
14 years 8 days ago
2007
CSCLP
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. Traditional resources in scheduling are simple machines where a capacity is the main restriction. However, in practice there frequently appear resources with more complex...
IPCO
1998
14 years 6 days 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 ...
RTSS
1992
IEEE
14 years 2 months ago
1992
IEEE
This paper addresses the problem of allocating (assigning and scheduling) periodic task modules to processing nodes in distributed real-time systems subject to task precedence and ...
SODA
2001
ACM
14 years 7 days 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 ...