8 search results - page 1 / 2 » Preemptive Multi-Machine Scheduling of Equal-Length Jobs to ... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
MICS
2010
13 years 3 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...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
JCO
1998
13 years 4 months ago
1998
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
BIRTHDAY
2009
Springer
13 years 9 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...