Sciweavers

200 search results - page 21 / 40
» Job Shop Scheduling Problems with Controllable Processing Ti...
Sort
View
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
14 years 1 months ago
Maximizing Job Completions Online
We consider the problem of maximizingthe number of jobs completed by their deadlinein an online single processor system where the jobs are preemptable and have release times. So i...
Bala Kalyanasundaram, Kirk Pruhs
HPCC
2007
Springer
14 years 3 months ago
A Complex Network-Based Approach for Job Scheduling in Grid Environments
Many optimization techniques have been adopted for efficient job scheduling in grid computing, such as: genetic algorithms, simulated annealing and stochastic methods. Such techni...
Renato Porfirio Ishii, Rodrigo Fernandes de Mello,...
FSTTCS
2007
Springer
14 years 3 months ago
Order Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
Naveen Garg, Amit Kumar, Vinayaka Pandit
PVLDB
2008
124views more  PVLDB 2008»
13 years 8 months ago
Scheduling shared scans of large data files
We study how best to schedule scans of large data files, in the presence of many simultaneous requests to a common set of files. The objective is to maximize the overall rate of p...
Parag Agrawal, Daniel Kifer, Christopher Olston
SIGMETRICS
2003
ACM
131views Hardware» more  SIGMETRICS 2003»
14 years 2 months ago
Classifying scheduling policies with respect to unfairness in an M/GI/1
It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy’s fairness....
Adam Wierman, Mor Harchol-Balter