188 search results - page 16 / 38 » Regret Minimization and Job Scheduling |
WSC
2007
13 years 10 months ago
2007
In this paper, we compare two scheduling procedures designed to minimize setup costs for a make-to-order electronics manufacturing. While setup costs are important, quick response...
ARCS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. This paper describes a job distribution system which focuses on standard desktop worker nodes in inhomogeneous and unreliable environments. The system is suited for gener...
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
ICALP
2003
Springer
14 years 25 days ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed ...