579 search results - page 20 / 116 » New Hybrid Optimization Algorithms for Machine Scheduling Pr... |
119
Voted
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...
137
click to vote
SODA
2010
ACM
14 years 11 months ago
2010
ACM
Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introd...
121
click to vote
JVA
2006
IEEE
15 years 8 months ago
2006
IEEE
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
127
Voted
ESA
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
143
Voted
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...