147 search results - page 4 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—We consider the question of obtaining tight delay guarantees for throughout-optimal link scheduling in arbitrary topology wireless ad-hoc networks. We consider two classes of sc...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
100
click to vote
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We study three scheduling problems (file redistribution, independent tasks scheduling and broadcasting) on large scale heterogeneous platforms under the Bounded Multi-port Model. I...
ANOR
2005
14 years 9 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
We consider the following scheduling problem. The input is a set of jobs with equal processing times, where each job is specified by its release time and deadline. The goal is to ...