188 search results - page 25 / 38 » Regret Minimization and Job Scheduling |
AAAI
1998
13 years 9 months ago
1998
Scheduling of multiple parallel machinesin the face of sequence dependent setups and downstream considerations is a hard problem. No single efficient algorithm is guaranteedto pro...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
COCOA
2008
Springer
13 years 9 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...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We resolve an open question raised by Feige & Scheideler by showing that the best known approximation algorithm for flow shops is essentially tight with respect to the used low...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In this paper, we consider two new online optimization problems (each with several variants), present similar online algorithms for both, and show that one reduces to the...