42 search results - page 3 / 9 » Mechanism Design for Fractional Scheduling on Unrelated Mach... |
DAGSTUHL
2006
15 years 1 months ago
2006
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from a new perspective: We assume that the data of ...
120
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...
108
Voted
ICCSA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Many problems in computer science are related to scheduling problems or embedding problems. Therefore it is an interesting topic to find efficient (approximation) algori...
114
Voted
IOR
2010
14 years 10 months ago
2010
We study the online version of the classical parallel machine scheduling problem to minimize the total weighted completion time from the perspective of algorithmic mechanism desig...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...