188 search results - page 10 / 38 » Regret Minimization and Job Scheduling |
162
click to vote
MICS
2010
15 years 4 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
173
click to vote
JSSPP
2009
Springer
16 years 15 days ago
2009
Springer
Abstract. As multi-core processors proliferate, it has become more important than ever to ensure efficient execution of parallel jobs on multiprocessor systems. In this paper, we s...
153
click to vote
FOCS
2008
IEEE
16 years 12 days ago
2008
IEEE
In the classic minimum makespan scheduling problem, we are given an input sequence of jobs with processing times. A scheduling algorithm has to assign the jobs to m parallel machi...
136
click to vote
CLUSTER
2005
IEEE
15 years 11 months ago
2005
IEEE
To balance performance goals and allow administrators to declaratively specify high-level performance goals, we apply complete search algorithms to design on-line job scheduling p...
133
click to vote
EUSFLAT
2003
15 years 7 months ago
2003
One machine scheduling problem with fuzzy processing times and a penalty for each job being late (the penalty is independent of the magnitude of the lateness) is considered. The o...