An \(O(T^{3})\) algorithm for the capacitated lot sizing problem with minimum order quantities (Q418062): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90B30 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C39 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6034956 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
production planning | |||
| Property / zbMATH Keywords: production planning / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
capacitated lot sizing problem | |||
| Property / zbMATH Keywords: capacitated lot sizing problem / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
single item | |||
| Property / zbMATH Keywords: single item / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
minimum order quantities | |||
| Property / zbMATH Keywords: minimum order quantities / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
capacity constraints | |||
| Property / zbMATH Keywords: capacity constraints / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
dynamic programming | |||
| Property / zbMATH Keywords: dynamic programming / rank | |||
Normal rank | |||
Revision as of 21:03, 29 June 2023
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
