Sciweavers

396 search results - page 4 / 80
» Meld Scheduling: A Technique for Relaxing Scheduling Constra...
Sort
View
AAAI
2007
13 years 9 months ago
Optimal Multi-Agent Scheduling with Constraint Programming
We consider the problem of computing optimal schedules in multi-agent systems. In these problems, actions of one agent can influence the actions of other agents, while the object...
Willem Jan van Hoeve, Carla P. Gomes, Bart Selman,...
JCO
1998
80views more  JCO 1998»
13 years 6 months ago
Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem
We consider the problem of scheduling n jobs with release dates on m identical parallel machines to minimize the average completion time of the jobs. We prove that the ratio of the...
Cynthia A. Phillips, Andreas S. Schulz, David B. S...
CONSTRAINTS
2011
13 years 2 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
IJAIT
2008
99views more  IJAIT 2008»
13 years 7 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
CCIA
2005
Springer
14 years 18 days ago
A Preliminary Study on the Relaxation of Numeric Features in Planning
Modern AI planners use different strategies to simplify the complexity of current planning problems and turn them more affordable. In this paper, we present a new approach that div...
Antonio Garrido, Eva Onaindia, Donato Herná...