Sciweavers

1125 search results - page 50 / 225
» On the job rotation problem
Sort
View
AOR
2007
107views more  AOR 2007»
13 years 10 months ago
Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
Juraj Hromkovic, Tobias Mömke, Kathleen Stein...
MP
2002
85views more  MP 2002»
13 years 9 months ago
From fluid relaxations to practical algorithms for job shop scheduling: the makespan objective
We design an algorithm, called the fluid synchronization algorithm (FSA), for the job shop scheduling problem with the objective of minimizing the makespan. We round an optimal sol...
Dimitris Bertsimas, Jay Sethuraman
JOT
2006
80views more  JOT 2006»
13 years 10 months ago
Remote Job Submission Security
This paper presents the middleware needed to deploy jobs to non-geographically colocated clusters with decentralized look-up severs. We have named our framework the Initium Remote...
Pawel Krepsztul, Douglas A. Lyon
CF
2009
ACM
14 years 2 months ago
Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors
Energy consumption and heat dissipation have become key considerations for modern high performance computer systems. In this paper, we focus on non-clairvoyant speed scaling to mi...
Hongyang Sun, Yangjie Cao, Wen-Jing Hsu
HPDC
2007
IEEE
14 years 4 months ago
Using content-addressable networks for load balancing in desktop grids
Desktop grids combine Peer-to-Peer and Grid computing techniques to improve the robustness, reliability and scalability of job execution infrastructures. However, efficiently mat...
Jik-Soo Kim, Peter J. Keleher, Michael A. Marsh, B...