Sciweavers

277 search results - page 9 / 56
» Just-In-Time Scheduling with Constraint Programming
Sort
View
155
Voted
AIPS
2008
15 years 8 months ago
Using Constraint Networks on Timelines to Model and Solve Planning and Scheduling Problems
In the last decades, there has been an increasing interest in the connection between planning and constraint programming. Several approaches were used, leading to different forms ...
Cédric Pralet, Gérard Verfaillie
160
Voted
CPAIOR
2009
Springer
16 years 12 days ago
The Polytope of Context-Free Grammar Constraints
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Ro...
168
Voted
ANOR
2011
96views more  ANOR 2011»
15 years 26 days ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder
147
Voted
CP
2004
Springer
15 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
167
Voted
SPAA
2010
ACM
15 years 6 months ago
Buffer-space efficient and deadlock-free scheduling of stream applications on multi-core architectures
We present a scheduling algorithm of stream programs for multi-core architectures called team scheduling. Compared to previous multi-core stream scheduling algorithms, team schedu...
JongSoo Park, William J. Dally