Sciweavers

841 search results - page 70 / 169
» Job Scheduling in Rings
Sort
View
LATIN
2000
Springer
15 years 3 months ago
Approximation Algorithms for Flexible Job Shop Problems
The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The p...
Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-O...
SC
2003
ACM
15 years 5 months ago
Job Superscheduler Architecture and Performance in Computational Grid Environments
Computational grids hold great promise in utilizing geographically separated heterogeneous resources to solve large-scale complex scientific problems. However, a number of major ...
Hongzhang Shan, Leonid Oliker, Rupak Biswas
ESA
1998
Springer
105views Algorithms» more  ESA 1998»
15 years 4 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
ARCS
2010
Springer
15 years 6 months ago
The JoSchKa System: Organic Job Distribution in Heterogeneous and Unreliable Environments
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...
Matthias Bonn, Hartmut Schmeck
IOR
2002
135views more  IOR 2002»
14 years 11 months ago
A Fluid Heuristic for Minimizing Makespan in Job Shops
We describe a simple on-line heuristic for scheduling job-shops. We assume there is a fixed set of routes for the jobs, and many jobs, say N, on each route. The heuristic uses saf...
J. G. Dai, Gideon Weiss