1292 search results - page 5 / 259 » Revisiting the optimal scheduling problem |
WEA
2010
Springer
14 years 3 months ago
2010
Springer
This paper is devoted to a study of the impact of using bound sets in biobjective optimization. This notion, introduced by Villareal and Karwan [19], has been independently revisit...
SIAMCOMP
2008
13 years 8 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
AAAI
2007
13 years 10 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
LION
2009
Springer
14 years 2 months ago
2009
Springer
The fitness landscape of the resource constrained project scheduling problem is investigated by examining the search space position type distribution and the correlation between t...
RTSS
2003
IEEE
14 years 1 months ago
2003
IEEE
The Pfair algorithms are optimal for independent periodic real-time tasks executing on a multiple-resource system, however, they incur a high scheduling overhead by making schedul...