Depth-first heuristic search for the job shop scheduling problem (Q363574)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Depth-first heuristic search for the job shop scheduling problem |
scientific article; zbMATH DE number 6203945
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Depth-first heuristic search for the job shop scheduling problem |
scientific article; zbMATH DE number 6203945 |
Statements
Depth-first heuristic search for the job shop scheduling problem (English)
0 references
3 September 2013
0 references
heuristic search
0 references
depth-first search
0 references
constraint propagation
0 references
scheduling
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91172546
0 references
0.9015176
0 references
0.8987773
0 references
0.88220286
0 references
0.88016236
0 references
0.8760058
0 references
0.8752335
0 references
0.87381715
0 references
