Sciweavers

239 search results - page 15 / 48
» On-line scheduling of parallel jobs on two machines
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Local Scheduling for Volunteer Computing
BOINC, a middleware system for volunteer computing, involves projects, which distribute jobs, and hosts, which execute jobs. The local (host-level) scheduler addresses two issues:...
David P. Anderson, John McLeod
IPCO
1998
99views Optimization» more  IPCO 1998»
13 years 9 months ago
Non-approximability Results for Scheduling Problems with Minsum Criteria
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...
Han Hoogeveen, Petra Schuurman, Gerhard J. Woeging...
ESWA
2008
162views more  ESWA 2008»
13 years 8 months ago
Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
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...
Der-Fang Shiau, Shu-Chen Cheng, Yueh-Min Huang
IPPS
2010
IEEE
13 years 5 months ago
Varying bandwidth resource allocation problem with bag constraints
We consider the problem of scheduling jobs on a pool of machines. Each job requires multiple machines on which it executes in parallel. For each job, the input specifies release ti...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Yogi...
CLUSTER
2006
IEEE
14 years 1 months ago
Multi-Objective Models for Scheduling Jobs on Parallel Computer Systems
This paper is concerned with the design of goal-oriented scheduling policies that deal with multiple goals on production parallel systems. Several objective models are compared, i...
Sangsuree Vasupongayya, Su-Hui Chiang