Computational complexity of uncapacitated multi-echelon production planning problems (Q1121774)
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 4104693
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of uncapacitated multi-echelon production planning problems |
scientific article; zbMATH DE number 4104693 |
Statements
Computational complexity of uncapacitated multi-echelon production planning problems (English)
0 references
1989
0 references
production planning
0 references
multi-echelon production-distribution systems
0 references
computational complexity
0 references
assembly system
0 references
joint replenishment system
0 references
Polynomial time algorithms
0 references
NP-complete
0 references
0 references
0 references
0.8476223945617676
0 references
0.8394142985343933
0 references
0.781277060508728
0 references
0.7791347503662109
0 references
0.7780007719993591
0 references
