39 search results - page 6 / 8 » Envy-Free Makespan Approximation |
APPROX
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
ISAAC
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
EUROPAR
2007
Springer
14 years 1 months ago
2007
Springer
The distributed nature of the grid results in the problem of scheduling parallel jobs produced by several independent organizations that have partial control over the system. We co...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
WAOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...