Sciweavers

614 search results - page 32 / 123
» Resource Minimization Job Scheduling
Sort
View
ISCAS
2003
IEEE
76views Hardware» more  ISCAS 2003»
15 years 9 months ago
Loop scheduling for minimizing schedule length and switching activities
Switching activity is one of the most important factors in power dissipation. This paper studies the scheduling problem that minimizes both schedule length and switching activitie...
Zili Shao, Qingfeng Zhuge, Edwin Hsing-Mean Sha, C...
141
Voted
SC
2003
ACM
15 years 9 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
IFIPTCS
2010
15 years 2 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...
COR
2010
127views more  COR 2010»
15 years 4 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...
SCHEDULING
2008
97views more  SCHEDULING 2008»
15 years 3 months ago
Effective on-line algorithms for reliable due date quotation and large-scale scheduling
We consider the sequencing of a series of jobs that arrive at a single processor over time. At each job's arrival time, a due date must be quoted for the job, and the job must...
Philip Kaminsky, Zu-Hsu Lee