277 search results - page 13 / 56 » Just-In-Time Scheduling with Constraint Programming |
CP
2005
Springer
14 years 1 months ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
COR
2006
13 years 7 months ago
2006
We discuss how constraint programming can improve the performance of a column generation solution process for the NP-hard Tail Assignment problem in aircraft scheduling. Combining...
MODELLIERUNG
2001
13 years 9 months ago
2001
Abstract: Models are important artefacts that support human understanding and communication. Often software development involves specialists from a variety of fields, e.g. mathemat...
ICCAD
2009
IEEE
13 years 5 months ago
2009
IEEE
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
CP
1998
Springer
13 years 11 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...