An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2011.01.007 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2049672007 / rank | |||
Normal rank |
Revision as of 21:08, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities |
scientific article |
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