147 search results - page 8 / 30 » An optimal lower bound for anonymous scheduling mechanisms |
114
click to vote
ANOR
2008
14 years 11 months ago
2008
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
109
click to vote
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Distributed constraint optimization (DCOP) is a promising approach to coordination, scheduling and task allocation in multi agent networks. In large-scale or low-bandwidth network...
102
click to vote
ALGORITHMICA
2005
14 years 11 months ago
2005
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
ACT We consider an optimal power and rate scheduling problem for a single user transmitting to a base station on a fading wireless link with the objective of minimizing the mean de...
ESA
2006
Springer
15 years 3 months ago
2006
Springer
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...