Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules (Q4589102)
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: Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules |
scientific article; zbMATH DE number 6803302
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules |
scientific article; zbMATH DE number 6803302 |
Statements
Solving the job shop scheduling problem with operators by depth-first heuristic search enhanced with global pruning rules (English)
0 references
7 November 2017
0 references
depth first search
0 references
pruning by dominance
0 references
job shop scheduling problem
0 references
operators
0 references
restarts
0 references
0.91172546
0 references
0.8741112
0 references
0.86464775
0 references
0.8527172
0 references
0.8467613
0 references
