Sciweavers

188 search results - page 10 / 38
» Regret Minimization and Job Scheduling
Sort
View
MICS
2010
77views more  MICS 2010»
13 years 6 months ago
Preemptive Scheduling of Equal-Length Jobs in Polynomial Time
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...
George B. Mertzios, Walter Unger
JSSPP
2009
Springer
14 years 2 months ago
Competitive Two-Level Adaptive Scheduling Using Resource Augmentation
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...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
FOCS
2008
IEEE
14 years 2 months ago
The Power of Reordering for Online Minimum Makespan Scheduling
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...
Matthias Englert, Deniz Özmen, Matthias Weste...
CLUSTER
2005
IEEE
14 years 1 months ago
Search-based Job Scheduling for Parallel Computer Workloads
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...
Sangsuree Vasupongayya, Su-Hui Chiang, B. Massey
EUSFLAT
2003
13 years 9 months ago
Minimisation of the expected weighted number of jobs being late with fuzzy processing time in a one machine system
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...
Barbara Gladysz, Dorota Kuchta