An efficient algorithm for the capacitated single item dynamic lot size problem (Q1262197)
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: An efficient algorithm for the capacitated single item dynamic lot size problem |
scientific article; zbMATH DE number 4123495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the capacitated single item dynamic lot size problem |
scientific article; zbMATH DE number 4123495 |
Statements
An efficient algorithm for the capacitated single item dynamic lot size problem (English)
0 references
1990
0 references
production scheduling
0 references
single item lot size problem
0 references
concave costs
0 references
worst case computational effort
0 references
computational results
0 references
0 references
