48 search results - page 3 / 10 » The Complexity of Mean Flow Time Scheduling Problems with Re... |
CORR
2006
Springer
13 years 5 months ago
2006
Springer
This paper presents scheduling algorithms for procrastinators, where the speed that a procrastinator executes a job increases as the due date approaches. We give optimal off-line ...
ICFP
2007
ACM
14 years 5 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
IPL
2008
13 years 5 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
We consider the problem of scheduling on-line a sequence of degradable intervals in a set of k identical machines. Our objective is to find a schedule that maximizes simultaneousl...
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
Scheduling data processing workflows (dataflows) on the cloud is a very complex and challenging task. It is essentially an optimization problem, very similar to query optimizati...