189 search results - page 2 / 38 » Models and Algorithms for Stochastic Online Scheduling |
OR
2007
Springer
13 years 11 months ago
2007
Springer
version of this extended abstract is published as [6].
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
AIPS
2000
13 years 6 months ago
2000
1 We consider the problem of scheduling an unknown sequence of tasks for a single server as the tasks arrive with the goal off maximizing the total weighted value of the tasks serv...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
CPAIOR
2008
Springer
13 years 7 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...