An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem (Q3821896)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem |
scientific article |
Statements
An <i>O</i>(<i>T</i><sup>2</sup>) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem (English)
0 references
1988
0 references
T-period single product dynamic lot size problem
0 references
optimal plans
0 references
