253 search results - page 17 / 51 » Approximation algorithm for the temperature-aware scheduling... |
105
click to vote
ESA
2006
Springer
15 years 3 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 ...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...
103
click to vote
STACS
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We consider the problem of scheduling jobs on related machines owned by selfish agents and provide the first deterministic mechanisms with constant approximation that a...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
One of the classic results in scheduling theory is the 2-approximation algorithm by Lenstra, Shmoys, and Tardos for the problem of scheduling jobs to minimize makespan on unrelate...
QEST
2006
IEEE
15 years 5 months ago
2006
IEEE
We give a quick overview of some key issues in (quantitative) call center management: building realistic models, developing efficient tools to simulate these models, finding qui...