239 search results - page 4 / 48 » On-line scheduling of parallel jobs on two machines |
COR
2011
13 years 2 months ago
2011
We consider the problem of scheduling a maximum profit selection of equal length jobs on m identical machines. Jobs arrive online over time and the goal is to determine a non-pre...
IPPS
2000
IEEE
14 years 8 days ago
2000
IEEE
In this paper we propose a new class of scheduling policies, dubbed Concurrent Gang, that combines the advantages of gang scheduling for communication and synchronization intensiv...
JSSPP
2009
Springer
14 years 2 months ago
2009
Springer
It is important to identify scalability constraints in existing job scheduling software as they are applied to next generation parallel systems. In this paper, we analyze the scala...
ESA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
WAOA
2004
Springer
14 years 1 months ago
2004
Springer
We consider a non-preemptive, stochastic parallel machine scheduling model with the goal to minimize the weighted completion times of jobs. In contrast to the classical stochastic ...