517 search results - page 25 / 104 » Approximation Algorithms for Scheduling with Reservations |
ESA
2006
Springer
15 years 1 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 ...
105
click to vote
IFIPTCS
2010
14 years 7 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...
CORR
2010
Springer
14 years 10 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...
CPAIOR
2008
Springer
14 years 11 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 ...
GLOBECOM
2006
IEEE
15 years 4 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 ...