200 search results - page 5 / 40 » Approximation Algorithms for Scheduling on Multiple Machines |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...
APPROX
2006
Springer
13 years 11 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...
ORL
2008
13 years 7 months ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
IPCO
1998
13 years 9 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 ...
SIAMCOMP
2010
13 years 2 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...