388 search results - page 2 / 78 » A Mixed Closure-CSP Method to Solve Scheduling Problems |
CPAIOR
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Logic-based Benders decomposition can combine mixed integer programming and constraint programming to solve planning and scheduling problems much faster than either metho...
AAAI
2000
13 years 10 months ago
2000
One challenge for research in constraint-based scheduling has been to produce scalable solution procedures under fairly general representational assumptions. Quite often, the comp...
PUK
2000
13 years 10 months ago
2000
AMC
2005
13 years 8 months ago
2005
COMPULOG
1999
Springer
14 years 1 months ago
1999
Springer
Planning and scheduling attracts an unceasing attention of computer science community. However, despite of similar character of both tasks, in most current systems planning and sch...