Sciweavers

8 search results - page 1 / 2
» Incremental Propagation of Time Windows on Disjunctive Resou...
Sort
View
FLAIRS
2006
13 years 6 months ago
Incremental Propagation of Time Windows on Disjunctive Resources
Constraint-based techniques are frequently used in solving real-life scheduling problems thanks to natural modeling capabilities and strong constraint propagation techniques encod...
Roman Barták
CONSTRAINTS
1998
94views more  CONSTRAINTS 1998»
13 years 4 months ago
Resource Constraints for Preemptive Job-shop Scheduling
This paper presents an experimental study of constraint propagation algorithms for preemptive scheduling. We propose generalizations of non-preemptive constraint propagation techni...
Claude Le Pape, Philippe Baptiste
DISOPT
2007
81views more  DISOPT 2007»
13 years 4 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 4 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
PLDI
2010
ACM
14 years 2 months ago
The Reachability-Bound Problem
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
Sumit Gulwani, Florian Zuleger