A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (Q1785294)
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: A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows |
scientific article; zbMATH DE number 6945308
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows |
scientific article; zbMATH DE number 6945308 |
Statements
A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows (English)
0 references
28 September 2018
0 references
lot-sizing
0 references
polynomial time algorithm
0 references
minimum order quantity
0 references
capacity constraint
0 references
dynamic time window
0 references
0 references
0 references
0 references
0 references
