517 search results - page 25 / 104 » Approximation Algorithms for Scheduling with Reservations |
143
Voted
ESA
2006
Springer
15 years 7 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 ...
177
click to vote
IFIPTCS
2010
15 years 1 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
110
click to vote
CORR
2010
Springer
15 years 3 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...
137
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Anticipatory algorithms for online stochastic optimization have been shown very effective in a variety of areas, including logistics, reservation systems, and scheduling. For such ...
117
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...