188 search results - page 22 / 38 » Regret Minimization and Job Scheduling |
STOC
1996
ACM
13 years 11 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
ICALP
2003
Springer
14 years 26 days ago
2003
Springer
We study algorithmic problems that are motivated by bandwidth trading in next generation networks. Typically, bandwidth trading involves sellers (e.g., network operators) interest...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—Data-intensive Grid applications require huge data transferring between multiple geographically separated computing nodes where computing tasks are executed. For a future WDM ne...
COR
2007
13 years 7 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
CPAIOR
2010
Springer
14 years 13 days ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...