A polynomial algorithm for the production/ordering planning problem with limited storage (Q856668)
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: A polynomial algorithm for the production/ordering planning problem with limited storage |
scientific article; zbMATH DE number 5078744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for the production/ordering planning problem with limited storage |
scientific article; zbMATH DE number 5078744 |
Statements
A polynomial algorithm for the production/ordering planning problem with limited storage (English)
0 references
7 December 2006
0 references
inventory-production: policies
0 references
capacity
0 references
dynamic programming
0 references
0.8616517186164856
0 references
0.8525108695030212
0 references
0.8450365662574768
0 references
0.8363245725631714
0 references
