2714 search results - page 52 / 543 » Approximation Schemes for Scheduling |
125
Voted
AICT
2005
IEEE
15 years 6 months ago
2005
IEEE
The choice of the scheduling algorithm is a major design criteria of a switch. Whereas it is known that maximum weight matching algorithms guarantee the stability of an input queu...
120
Voted
CORR
2008
Springer
15 years 17 days 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...
114
Voted
APPROX
2006
Springer
15 years 4 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...
114
click to vote
APPROX
2008
Springer
15 years 2 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...
EUROPAR
2010
Springer
15 years 20 days ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...