Improving branch and bound for jobshop scheduling with constraint propagation (Q6567676)
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: Improving branch and bound for jobshop scheduling with constraint propagation |
scientific article; zbMATH DE number 7876626
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improving branch and bound for jobshop scheduling with constraint propagation |
scientific article; zbMATH DE number 7876626 |
Statements
Improving branch and bound for jobshop scheduling with constraint propagation (English)
0 references
5 July 2024
0 references
jobshop scheduling
0 references
branch-and-bound
0 references
heuristics
0 references
propagation
0 references
constraints
0 references
0 references
0.8293272256851196
0 references
0.8057357668876648
0 references
0.7985232472419739
0 references
0.7971779704093933
0 references
