109 search results - page 3 / 22 » Convex programming for scheduling unrelated parallel machine... |
ISPAN
2005
IEEE
15 years 5 months ago
2005
IEEE
In classical mechanism design setting the outcome of the mechanism is computed by a trusted central party. In this paper we consider distributed implementations in which the outco...
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
116
click to vote
MP
2007
14 years 11 months ago
2007
We consider machine scheduling on unrelated parallel machines with the objective to minimize the schedule makespan. We assume that, in addition to its machine dependence, the proce...
112
click to vote
ESA
2000
Springer
15 years 3 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
121
click to vote
LATIN
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of designing truthful algorithms for scheduling a set of tasks, each one owned by a selfish agent, to a set of parallel (identical or unrelated) machines in or...