239 search results - page 3 / 48 » On-line scheduling of parallel jobs on two machines |
DAGSTUHL
2007
14 years 11 months ago
2007
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
87
Voted
COR
2006
14 years 9 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
81
Voted
PPAM
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We address parallel jobs scheduling problem for computational GRID systems. We concentrate on two-level hierarchy scheduling: at the first level broker allocates computa...
87
Voted
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
SODA
2001
ACM
14 years 11 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 ...