348 search results - page 2 / 70 » Using Constraint Networks on Timelines to Model and Solve Pl... |
CP
1998
Springer
13 years 10 months ago
1998
Springer
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
EAAI
2008
13 years 6 months ago
2008
Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distribu...
CONSTRAINTS
2006
13 years 6 months ago
2006
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...
CI
2011
13 years 1 months ago
2011
This paper is focused on how a general-purpose hierarchical planning representation, based on the HTN paradigm, can be used to support the representation of oncology treatment pro...
CP
1998
Springer
13 years 10 months ago
1998
Springer
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...