188 search results - page 1 / 38 » Regret Minimization and Job Scheduling |
SOFSEM
2010
Springer
14 years 1 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
SCHEDULING
2008
13 years 4 months ago
2008
ORL
2002
13 years 4 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
DISOPT
2008
13 years 5 months ago
2008
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
We consider the following fundamental scheduling problem. The input consists of n jobs to be scheduled on a set of machines of bounded capacities. Each job is associated with a re...