206 search results - page 22 / 42 » Better Bounds for Online Scheduling |
CNSM
2010
13 years 5 months ago
2010
Abstract--In this paper, we present demand-side energy management under real-time demand-response pricing as a task scheduling problem which is NP-hard. Using minmax as the objecti...
JCO
2000
13 years 7 months ago
2000
We consider the problem of off-line throughput maximization for job scheduling on one or more machines, where each job has a release time, a deadline and a profit. Most of the ver...
COMCOM
2006
13 years 7 months ago
2006
In this paper, we study the problem of constructing an energy efficient data aggregation tree for data gathering in wireless sensor networks. We consider a real-time scenario wher...
WAOA
2004
Springer
14 years 28 days ago
2004
Springer
Borodin, Nielsen and Rackoff [5] proposed a framework for ing the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] ext...
IOR
2007
13 years 7 months ago
2007
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...