Sciweavers

CONSTRAINTS
2011
13 years 6 months ago
A global constraint for total weighted completion time for unary resources
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
András Kovács, J. Christopher Beck
IOR
2010
161views more  IOR 2010»
13 years 10 months ago
Mechanism Design for Decentralized Online Machine Scheduling
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...
Birgit Heydenreich, Rudolf Müller, Marc Uetz
EAAI
2008
101views more  EAAI 2008»
13 years 11 months ago
A global constraint for total weighted completion time for cumulative resources
The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage a...
András Kovács, J. Christopher Beck
GECON
2008
Springer
152views Business» more  GECON 2008»
14 years 18 days ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
COCOA
2008
Springer
14 years 1 months ago
Stochastic Online Scheduling Revisited
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
Andreas S. Schulz
ICALP
2010
Springer
14 years 4 months ago
Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
Nikhil Bansal, Subhash Khot
CPAIOR
2007
Springer
14 years 5 months ago
A Global Constraint for Total Weighted Completion Time
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, an O(n4 ) algorithm...
András Kovács, J. Christopher Beck