253 search results - page 5 / 51 » Approximation algorithm for the temperature-aware scheduling... |
105
click to vote
IPCO
1998
14 years 11 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
EOR
2006
14 years 9 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
83
Voted
FORMATS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Quantitative model checking computes the probability values of a given property quantifying over all possible schedulers. It turns out that maximum and minimum probabilit...
DAM
2007
14 years 9 months ago
2007
We give a short proof of a result of Tovey [6] on the inapproximability of a scheduling problem known as precedence constrained class sequencing. In addition, we present an approxi...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Motivated by applications in grid computing and projects management, we study multiprocessor scheduling in scenarios where there is uncertainty in the successful execution of jobs...