114 search results - page 10 / 23 » On the Robust Single Machine Scheduling Problem |
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we deal with the large-scale divisible load problem studied in [12]. We show how to reduce this problem to a classical preemptive scheduling problem on a single mac...
106
click to vote
MFCS
2004
Springer
15 years 5 months ago
2004
Springer
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
102
click to vote
ORL
2002
14 years 11 months ago
2002
We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, o...
173
click to vote
Publication
In this paper, we address the problem of automatically detecting and tracking a variable number of persons in complex
scenes using a monocular, potentially moving, uncalibrated ca...
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
It is well known that the Earliest-Deadline-First (EDF) and the Least-Laxity-First (LLF) algorithms are optimal algorithms for the problem of preemptively scheduling jobs that arr...