68 search results - page 11 / 14 » Online scheduling of parallel jobs on two machines is 2-comp... |
ECCC
2000
13 years 8 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
A fundamental challenge in Internet computing (IC) is to efficiently schedule computations having complex interjob dependencies, given the unpredictability of remote machines, in...
JSSPP
2005
Springer
14 years 2 months ago
2005
Springer
User estimates of job runtimes have emerged as an important component of the workload on parallel machines, and can have a significant impact on how a scheduler treats different ...
IPCO
1998
13 years 10 months ago
1998
We provide several non-approximability results for deterministic scheduling problems whose objective is to minimize the total job completion time. Unless P = NP, none of the probl...
ESWA
2008
13 years 9 months ago
2008
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...