1102 search results - page 9 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
85
Voted
ECRTS
1999
IEEE
15 years 2 months ago
1999
IEEE
Despite the significant body of results in real-time scheduling, many real world problems are not easily supported. While algorithms such as Earliest Deadline First, Rate Monotoni...
103
Voted
AAAI
2000
14 years 11 months ago
2000
We propose a novel algorithmic framework to solve an integrated planning and scheduling problem in supply chain management. This problem involves the integration of an inventory m...
87
Voted
CCIA
2005
Springer
15 years 3 months ago
2005
Springer
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...
VLDB
2002
ACM
14 years 10 months ago
2002
ACM
A workflow consists of a collection of coordinated tasks designed to carry out a welldefined complex process, such as catalog ordering, trip planning, or a business process in an ...
84
Voted
SARA
2009
Springer
15 years 4 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...