Sciweavers

26 search results - page 1 / 6
» Job scheduling methods for reducing waiting time variance
Sort
View
COR
2007
81views more  COR 2007»
13 years 4 months ago
Job scheduling methods for reducing waiting time variance
Minimizing Waiting Time Variance (WTV) is a job scheduling problem where we schedule a batch of n jobs, for servicing on a single resource, in such a way that the variance of thei...
Nong Ye, Xueping Li, Toni Farley, Xiaoyun Xu
HPDC
2009
IEEE
13 years 11 months ago
Trace-based evaluation of job runtime and queue wait time predictions in grids
Large-scale distributed computing systems such as grids are serving a growing number of scientists. These environments bring about not only the advantages of an economy of scale, ...
Omer Ozan Sonmez, Nezih Yigitbasi, Alexandru Iosup...
ICPADS
2006
IEEE
13 years 11 months ago
Ensuring Fairness Among Participating Clusters During Multi-site Parallel Job Scheduling
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
William M. Jones, Walter B. Ligon III
ICRA
1999
IEEE
114views Robotics» more  ICRA 1999»
13 years 9 months ago
An Effective Method to Reduce Inventory in Job Shops
Inventory plays a major role in deciding the overall manufacturing costs, and a good scheduling system should balance the on-time delivery of products versus low work-in-process (W...
Peter B. Luh, Xiaohui Zhou, Robert N. Tomastik
CLOUDCOM
2010
Springer
13 years 2 months ago
Scaling Populations of a Genetic Algorithm for Job Shop Scheduling Problems Using MapReduce
Inspired by Darwinian evolution, a genetic algorithm (GA) approach is one of the popular heuristic methods for solving hard problems, such as the Job Shop Scheduling Problem (JSSP...
Di-Wei Huang, Jimmy Lin