A polynomial algorithm for a multi-item capacitated production planning problem (Q1316097)
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 519590
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial algorithm for a multi-item capacitated production planning problem |
scientific article; zbMATH DE number 519590 |
Statements
A polynomial algorithm for a multi-item capacitated production planning problem (English)
0 references
14 March 1994
0 references
multi-item
0 references
lot sizing
0 references
computational bound
0 references
production planning
0 references
manufacturing
0 references
polynomial time algorithm
0 references
worst case computational bound
0 references
single machine static scheduling
0 references
0.8620033860206604
0 references
0.8125514388084412
0 references
0.8084914684295654
0 references
0.7980614900588989
0 references
