An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062)
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 O(T^3) algorithm for the capacitated lot sizing problem with minimum order quantities |
scientific article; zbMATH DE number 6034956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities |
scientific article; zbMATH DE number 6034956 |
Statements
An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (English)
0 references
14 May 2012
0 references
production planning
0 references
capacitated lot sizing problem
0 references
single item
0 references
minimum order quantities
0 references
capacity constraints
0 references
dynamic programming
0 references
0 references
0 references
0.9093462
0 references
0.90060973
0 references
0.88962394
0 references
0.8826828
0 references
0.8747444
0 references
0.87421167
0 references
0.87097114
0 references
0.86719173
0 references
0.8655089
0 references
