On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284)
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 4167839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of dynamic programming for sequencing problems with precedence constraints |
scientific article; zbMATH DE number 4167839 |
Statements
On the complexity of dynamic programming for sequencing problems with precedence constraints (English)
0 references
1990
0 references
precedence constrained sequencing
0 references
assembly line balancing
0 references
regression equations
0 references
storage requirements
0 references
0 references
0 references
0 references
0.8111711144447327
0 references
0.785290002822876
0 references
0.7657354474067688
0 references
0.7643068432807922
0 references
