720 search results - page 25 / 144 » Machine scheduling with resource dependent processing times |
MICS
2010
14 years 10 months ago
2010
We study the preemptive scheduling problem of a set of n jobs with release times and equal processing times on a single machine. The objective is to minimize the sum of the weighte...
IPL
2008
14 years 11 months ago
2008
We consider the online problem of scheduling jobs with equal processing times on a single machine. Each job has a release time and a deadline, and the goal is to maximize the numb...
106
click to vote
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose ...
116
click to vote
STOC
1997
ACM
15 years 4 months ago
1997
ACM
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...
106
click to vote
GRID
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we present a resource conscious dynamic scheduling strategy for handling large volume computationally intensive loads in a Grid system involving multiple sources an...