Sciweavers

12 search results - page 1 / 3
» Edge Finding for Cumulative Scheduling
Sort
View
INFORMS
2008
62views more  INFORMS 2008»
13 years 4 months ago
Edge Finding for Cumulative Scheduling
Edge-finding algorithms for cumulative scheduling are at the core of commercial constraint-based schedulers. This paper shows that Nuijten's edge finder for cumulative schedu...
Luc Mercier, Pascal Van Hentenryck
CONSTRAINTS
2006
99views more  CONSTRAINTS 2006»
13 years 4 months ago
An Integrated Method for Planning and Scheduling to Minimize Tardiness
We combine mixed integer linear programming (MILP) and constraint programming (CP) to minimize tardiness in planning and scheduling. Tasks are allocated to facilities using MILP an...
John N. Hooker
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
CJ
1999
87views more  CJ 1999»
13 years 4 months ago
Evolution-Based Scheduling of Computations and Communications on Distributed Memory Multicomputers
We present a compiler optimization approach that uses the simulated evolution (SE) paradigm to enhance the finish time of heuristically scheduled computations with communication t...
Mayez A. Al-Mouhamed
DATE
2006
IEEE
91views Hardware» more  DATE 2006»
13 years 8 months ago
Efficient incremental clock latency scheduling for large circuits
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
Christoph Albrecht