A mixed closure-CSP method for solving scheduling problems (Q1768502)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2145994
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A mixed closure-CSP method for solving scheduling problems |
scientific article; zbMATH DE number 2145994 |
Statements
A mixed closure-CSP method for solving scheduling problems (English)
0 references
15 March 2005
0 references
planning and scheduling
0 references
temporal reasoning
0 references
heuristic search
0 references
0.769831657409668
0 references
0.7371457815170288
0 references
0.7367562055587769
0 references
