Sciweavers

33 search results - page 1 / 7
» Cost Sharing Methods for Makespan and Completion Time Schedu...
Sort
View
STACS
2007
Springer
13 years 11 months ago
Cost Sharing Methods for Makespan and Completion Time Scheduling
Abstract. Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimiz...
Janina A. Brenner, Guido Schäfer
IPL
2008
103views more  IPL 2008»
13 years 5 months ago
New efficiency results for makespan cost sharing
In the context of scheduling, we study social cost efficiency for a cost-sharing problem in which the service provider's cost is determined by the makespan of the served agen...
Yvonne Bleischwitz, Florian Schoppmann
CP
2004
Springer
13 years 11 months ago
A Hybrid Method for Planning and Scheduling
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
John N. Hooker
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
14 years 4 days ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
IFIPTCS
2010
13 years 3 months ago
Approximating the Non-contiguous Multiple Organization Packing Problem
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
Marin Bougeret, Pierre-François Dutot, Klau...